Describes an independent loop within the graph. The loop is defined by an edge that is not part of the spanning tree; the loop itself is closed by the tree paths leading to each of the edge's vertices.
| Type | Visibility | Attributes | Name | Initial | |||
|---|---|---|---|---|---|---|---|
| integer(kind=int32), | public | :: | cut_edge | = | 0 |
The index of the edge closing the loop. |
|
| integer(kind=int32), | public | :: | vertex_1 | = | 0 |
The first vertex of the cut edge. |
|
| integer(kind=int32), | public | :: | vertex_2 | = | 0 |
The second vertex of the cut edge. |