Skip to content

Commit

Permalink
Add error for cycle among nonbreakable branches.
Browse files Browse the repository at this point in the history
  • Loading branch information
HansOlsson committed Nov 9, 2023
1 parent 092e643 commit 5b21aca
Showing 1 changed file with 2 additions and 0 deletions.
2 changes: 2 additions & 0 deletions chapters/connectors.tex
Original file line number Diff line number Diff line change
Expand Up @@ -945,6 +945,8 @@ \subsubsection{Spanning Trees}
If a graph of this set does not contain any definite root node, then one potential root node in this subgraph that has the lowest priority number is selected to be the root of that subgraph.
The selection can be inquired in a class with function \lstinline!Connections.isRoot!, see table above.
\end{enumerate}
\item
If there is a cycle among nonbreakable branches it is an error, as it is not possible to construct a spanning tree.
\item
For a subgraph with $n$ selected roots, optional spanning-tree edges are removed such that the result is a set of $n$ spanning trees with the selected root nodes as roots.
\end{enumerate}
Expand Down

0 comments on commit 5b21aca

Please sign in to comment.