Represents the longest directed path in an acyclic graph as computed by LongestPath.
Inheritance Hierarchy
Remarks
This class cannot be instantiated
Members
No filters for this type
Properties
If there has been edge costs provided, this is the sum of costs along the path. If there were no costs, this is the length of the path, as all edges have a uniform cost of 1.
If there is no longest path in the graph (because there are no edges), this is 0.
readonlyfinal
Gets the path's edges.
Gets the path's edges.
If there is no longest path in the graph (because there are no edges), this collection is empty.
readonlyfinal
Gets the path's nodes.
Gets the path's nodes.
If there is no longest path in the graph (because there are no edges), this collection is empty.
readonlyfinal
Gets the path.
Gets the path.
If there is no longest path in the graph (because there are no edges), this is
null.readonlyfinal