Hets - the Heterogeneous Tool Set

Copyright(c) Jonathan von Schroeder, DFKI Bremen 2012
LicenseGPLv2 or higher, see LICENSE.txt
MaintainerJonathan von Schroeder <jonathan.von_schroeder@dfki.de>
Stabilityprovisional
Portabilityportable
Safe HaskellSafe-Inferred

Common.GraphAlgo

Description

 

Documentation

data Graph node edge

Constructors

Graph 

Fields

neighbours :: node -> [(edge, node)]
 
weight :: edge -> Int
 

data Node

Constructors

Node String 

Instances

data Edge

Constructors

Edge (String, String) 

Instances

mapMin :: (a -> a -> Bool) -> Map k a -> Maybe (k, a)

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

test1 :: [[String]]