Static class: RT.Dijkstra.DijkstrasAlgorithm

• Assembly: RT.Dijkstra, Version=1.0.0.0, Culture=neutral, PublicKeyToken=null
• Namespace: RT.Dijkstra

Summary

Provides a method to run Dijkstra’s Algorithm (a generalization of breadth-first search) on an arbitrary directed graph with positive edge weights.

Static methods

IEnumerable<Step<TWeight, TLabel>>

Run<TWeight, TLabel>(Node<TWeight, TLabel> startNode, TWeight initialWeight, Func<TWeight, TWeight, TWeight> add, out TWeight totalWeight)

Runs Dijkstra’s Algorithm (a generalization of breadth-first search) on an arbitrary graph.