Graphene.Algorithms

Documentation

kruskal :: (Ord v, Ord e) => Graph v e -> Graph v e

Kruskal's minimum spanning tree algorithm

dfs :: Eq v => v -> Graph e v -> [v]

Depth first search for connections of v

bfs :: Eq v => v -> Graph e v -> [v]

Breadth first search for connections of v

dijkstra :: (Eq v, Ord v) => Graph Int v -> v -> DijkstraState Int v

Run dijkstra's algorithm on a graph starting at vertex v

data DijkstraState e v

Container for Dijkstra's algorithm information

Instances

(Eq e, Eq v) => Eq (DijkstraState e v)

(Show e, Show v) => Show (DijkstraState e v)

underlyingGraph :: Lens' (DijkstraState e v) (Graph e v)

distancePairings :: Lens' (DijkstraState e v) (Map v Int)

prevs :: Lens' (DijkstraState e v) (Map v (Maybe v))

unvisited :: Lens' (DijkstraState e v) [v]

visited :: Lens' (DijkstraState e v) [v]

from :: Lens' (DijkstraState e v) v