DijkstraFast

Full name Microsoft.VisualBasic.Data.GraphTheory.Dijkstra.PQDijkstra.DijkstraFast Assembly Microsoft.VisualBasic.Data.GraphTheory Members 4

Implements a generalized Dijkstra's algorithm to calculate both minimum distance and minimum path.

00 Remarks

For this algorithm, all nodes should be provided, and handled in the delegate methods, including the start and finish nodes.

01 Syntax

Microsoft.VisualBasic.Data.GraphTheory.Dijkstra.PQDijkstra.DijkstraFast

02 Methods

Name	Overloads	Summary
.ctor	1	Creates an instance of the Dijkstra class.
Perform	1
Perform2	1
GetMinimumPath	1

03 Members

method .ctor #

Creates an instance of the Dijkstra class.

Parameters

Name	Type	Description
`totalNodeCount`	`Int32`	The total number of nodes in the graph.
`traversalCost`	InternodeTraversalCost	The delegate that can provide the cost of a transition between any two nodes.
`hint`	NearbyNodesHint	An optional delegate that can provide a small subset of nodes that a given node may be connected to.

method Perform #

Perform(Int32)

method Perform2 #

Perform2(Int32)

method GetMinimumPath #

GetMinimumPath(Int32, Int32)