shortestPath(D,start,finishSet)
Given a digraph D, a vertex start in D, and a list of vertices finishSet of D, this function returns the shortest path in D from start to finishSet.
It is safe to use this in applications that have nothing to do with coding theory.
|
|
The object shortestPath is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/CodingTheory.m2:3692:0.