- hasCycle
Returns true if network has at least one cycle. A cycle is defined as a
non-empty subset of edges in
- reachableNodes
Returns the set of nodes that are reachable from node. Node B is defined as
reachable from node A if
- copyOf
Creates a mutable copy of graph with the same nodes, edges, and edge values.
- canTraverseWithoutReusingEdge
Determines whether an edge has already been used during traversal. In the
directed case a cycle is a
- checkNonNegative
- checkPositive
- subgraphHasCycle
Performs a traversal of the nodes reachable from node. If we ever reach a node
we've already visited
- transpose
Returns a view of graph with the direction (if any) of every edge reversed. All
other properties rem
- inducedSubgraph
Returns the subgraph of graph induced by nodes. This subgraph is a new graph
that contains all of th