Versions in this module Expand all Collapse all v1 v1.0.4 Jul 29, 2015 v1.0.3 Jul 20, 2015 Changes in this version + func Dominators(start graph.Node, g graph.Graph) map[int]internal.Set + func Kruskal(dst graph.MutableUndirected, g EdgeListerGraph) + func NullHeuristic(_, _ graph.Node) float64 + func PostDominators(end graph.Node, g graph.Graph) map[int]internal.Set + func Prim(dst graph.MutableUndirected, g EdgeListerGraph) + type AllShortest struct + func DijkstraAllPaths(g graph.Graph) (paths AllShortest) + func FloydWarshall(g graph.Graph) (paths AllShortest, ok bool) + func JohnsonAllPaths(g graph.Graph) (paths AllShortest, ok bool) + func (p AllShortest) AllBetween(u, v graph.Node) (paths [][]graph.Node, weight float64) + func (p AllShortest) Between(u, v graph.Node) (path []graph.Node, weight float64, unique bool) + func (p AllShortest) Weight(u, v graph.Node) float64 + type EdgeListerGraph interface + Edges func() []graph.Edge + type Heuristic func(x, y graph.Node) float64 + type HeuristicCoster interface + HeuristicCost func(x, y graph.Node) float64 + type Shortest struct + func AStar(s, t graph.Node, g graph.Graph, h Heuristic) (path Shortest, expanded int) + func BellmanFordFrom(u graph.Node, g graph.Graph) (path Shortest, ok bool) + func DijkstraFrom(u graph.Node, g graph.Graph) Shortest + func (p Shortest) From() graph.Node + func (p Shortest) To(v graph.Node) (path []graph.Node, weight float64) + func (p Shortest) WeightTo(v graph.Node) float64