Copyright | (c) Jonathan von Schroeder, DFKI Bremen 2012 |
---|---|
License | GPLv2 or higher, see LICENSE.txt |
Maintainer | Jonathan von Schroeder <jonathan.von_schroeder@dfki.de> |
Stability | provisional |
Portability | portable |
Safe Haskell | Safe-Inferred |
Documentation
data Graph node edge
Graph | |
|
dijkstra :: (Show node, Show edge, Ord node) => node -> (node -> Bool) -> Graph node edge -> Maybe ([(node, edge)], node)
yen :: (Ord node, Eq edge, Show node, Show edge) => Int -> node -> (node -> Bool) -> Graph node edge -> [([(node, edge)], node)]
prettyPath :: (Show node, Show edge) => ([(node, edge)], node) -> String
test_graph :: Graph Node Edge