Skip to content

GraphDistance

Status: Stable

documented, exercised by the test suite and/or worked examples, with no known limitations recorded.

Description

GraphDistance[g,s,t] gives the length of a shortest path from s to t (Infinity if unreachable).

Examples

No verified examples yet for this function.

Implementation notes

Attributes: Protected.

Implementation status

Stable — documented, exercised by the test suite and/or worked examples, with no known limitations recorded.

References