一个简单的路径查找问题

最新推荐文章于 2022-04-19 15:22:02 发布

zevine

最新推荐文章于 2022-04-19 15:22:02 发布

阅读量357

点赞数

本文链接：https://blog.csdn.net/zevine/article/details/6330961

版权

这是网上的haskell99题中第81题

Problem 81

(**) Path from one node to another one

Write a function that, given two nodes a and b in a graph, returns all the acyclic paths from a to b.

Example in Haskell:

paths 1 4 [(1,2),(2,3),(1,3),(3,4),(4,2),(5,6)]
[[1,2,3,4],[1,3,4]]
paths 2 6 [(1,2),(2,3),(1,3),(3,4),(4,2),(5,6)]
[]

以前都是用C++来解决图论问题，现在用一个简单的Haskell程序更见清晰明了

paths :: Int -> Int -> [(Int , Int)] -> [[Int]]
paths start end  zs = let (xs,ys) = partition (/(_,z) -> z == end ) zs
                                  in  map (++ [ end] )  ( concat . map (/(e, _) -> if e == start then [[start]] else paths start e  ys) $  xs )