| DijkstraAllPairsSP Constructor |
Computes a shortest paths tree from each vertex to 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)
SyntaxC#
public DijkstraAllPairsSP( EdgeWeightedDigraph G )
Parameters
- G
- Type: Algs4NetEdgeWeightedDigraph
the edge-weighted digraph
Exceptions| Exception | Condition |
|---|---|
| ArgumentException | if an edge weight is negative |
| ArgumentException | unless 0 <= s <= V - 1 |
See Also