Directed Acyclic Graph single source shortest path algorithm.
Namespace:
QuickGraph.Algorithms.ShortestPathAssembly: QuickGraph.Algorithms (in QuickGraph.Algorithms.dll) Version: 2.4.2.1407 (2.4.2.1407)
Syntax
| C# |
|---|
public class DagShortestPathAlgorithm : IVertexColorizerAlgorithm, IAlgorithm |
| Visual Basic (Declaration) |
|---|
Public Class DagShortestPathAlgorithm _ Implements IVertexColorizerAlgorithm, IAlgorithm |
Remarks
This algorithm solves the single-source shortest-paths problem on a weighted, directed acyclic graph (DAG).
This algorithm is more efficient for DAG's than either the DijkstraShortestPathAlgorithm or BellmanFordShortestPathAlgorithm.. Use BreadthFirstSearchAlgorithm instead of this algorithm when all edge weights are equal to one.
It is strongly inspired from the Boost Graph Library implementation.
