Structs§
- Edge
List Debugger - Graph
- | Simple undirected unweighted graph | data structure no checks whatsoever | should call init_size(..) first then | insert_edge(..) to populate | | IMP: nodes have indexes from 0 to n-1 | | IMP: graph is assumed to be connected |
- Minimum
Union Cycle Debugger - Node
ToMinimum Union Cycle Debugger
Traits§
Functions§
- extract_
graph_ name - print_
edgelist_ and_ mucs - TODO: remove this