Click or drag to resize
BellmanFordSP Constructor
Computes a shortest paths tree from s to every other vertex in the edge-weighted digraph G.

Namespace: Algs4Net
Assembly: Algs4Net (in Algs4Net.dll) Version: 1.0.0.0 (1.0.0.0)
Syntax
C#
Copy
public BellmanFordSP(
	EdgeWeightedDigraph G,
	int s
)

Parameters

G
Type: Algs4NetEdgeWeightedDigraph
the acyclic digraph
s
Type: SystemInt32
the source vertex
Exceptions
ExceptionCondition
ArgumentExceptionunless 0 <= s <= V - 1
See Also