FindShortestPath

Status: Stable

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

Description

FindShortestPath[g,s,t] gives a shortest path from s to t as a list of vertices ({} if none).

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

• Source: src/graph/graph.c
• Specification index: Mathilda_spec.md