Dijkstra shortest path algorithm.

Namespace:  QuickGraph.Algorithms.ShortestPath
Assembly:  QuickGraph.Algorithms (in QuickGraph.Algorithms.dll) Version: 2.4.2.970 (2.4.2.970)

Syntax

C#
public class DijkstraShortestPathAlgorithm : IVertexColorizerAlgorithm, 
	IPredecessorRecorderAlgorithm, IDistanceRecorderAlgorithm, IAlgorithm
Visual Basic (Declaration)
Public Class DijkstraShortestPathAlgorithm _
	Implements IVertexColorizerAlgorithm, IPredecessorRecorderAlgorithm, IDistanceRecorderAlgorithm, IAlgorithm

Remarks

This algorithm solves the single-source shortest-paths problem on a weighted, directed for the case where all edge weights are nonnegative. It is strongly inspired from the Boost Graph Library implementation. Use the Bellman-Ford algorithm for the case when some edge weights are negative. Use breadth-first search instead of Dijkstra's algorithm when all edge weights are equal to one.

Inheritance Hierarchy

System..::.Object
  QuickGraph.Algorithms.ShortestPath..::.DijkstraShortestPathAlgorithm

See Also