DijkstraAlgoritm

Full name Microsoft.VisualBasic.Data.GraphTheory.Analysis.Dijkstra.DijkstraAlgoritm Assembly Microsoft.VisualBasic.Data.GraphTheory Members 8

01 Syntax

Microsoft.VisualBasic.Data.GraphTheory.Analysis.Dijkstra.DijkstraAlgoritm

02 Methods

Name	Overloads	Summary
.ctor	1
DistanceFinder	1	Calculates the minimum possible distance from root node to all other nodes.
DistanceFinderInternal	1	Calculates the minimum possible distance from root node to all other nodes.
FindPathBiDirectional	1	Calculates the shortest path using Bi-Directional Dijkstra algorithm.
FindPath	1	Calculates the shortest path from startIndex to endIndex specifically.

03 Properties

Name	Overloads	Summary
parallel	1

04 Fields

Name	Overloads	Summary
vertices	1	网络图中的节点总数
pathCache	1	缓存不同起点的计算结果，Key为startIndex

05 Members

method .ctor #

#ctor(SparseMatrix, Int32)

Parameters

Name	Type	Description
`graph`	`SparseMatrix`	The adjacency matrix of the graph.
`vertices`	`Int32`	Total number of vertices.

method DistanceFinder #

DistanceFinder(Int32)

Calculates the minimum possible distance from root node to all other nodes.

Parameters

Name	Type	Description
`startIndex`	`Int32`	-

method DistanceFinderInternal #

DistanceFinderInternal(Int32, Nullable(Of Int32))

Calculates the minimum possible distance from root node to all other nodes.

Parameters

Name	Type	Description
`startIndex`	`Int32`	-

method FindPathBiDirectional #

FindPathBiDirectional(SparseMatrix, Int32, Int32, Int32)

Calculates the shortest path using Bi-Directional Dijkstra algorithm.

Parameters

Name	Type	Description
`graph`	`SparseMatrix`	The adjacency matrix of the graph.
`vertices`	`Int32`	Total number of vertices.
`startIndex`	`Int32`	The starting node index.
`endIndex`	`Int32`	The target node index.

Returns

Returns the target Node containing path and distance info. Returns Nothing if path not found.

method FindPath #

FindPath(Int32, Int32)

Calculates the shortest path from startIndex to endIndex specifically.

Parameters

Name	Type	Description
`startIndex`	`Int32`	The starting node index.
`endIndex`	`Int32`	The target node index.

Returns

Returns the target Node containing path and distance info. Returns Nothing if path not found.

field vertices #

vertices

网络图中的节点总数

field pathCache #

pathCache

缓存不同起点的计算结果，Key为startIndex

property parallel #

parallel