|
discrete-modulus (C++)
Reference implementations of discrete modulus algorithms (C++)
|
One round of spanning_tree_modulus's main loop: the component it was carved from, the edge set dispatched at eta* = theta, and theta itself. More...
#include <discrete_modulus/solver_trace.hpp>
Public Attributes | |
| rational< long > | theta |
| std::vector< Vertex > | vertices |
| the component's vertex set | |
| std::vector< std::pair< Vertex, Vertex > > | crit_set |
| the dispatched edges | |
One round of spanning_tree_modulus's main loop: the component it was carved from, the edge set dispatched at eta* = theta, and theta itself.
Vertex ids are the original input graph's vertex descriptors (mapped back via vertex_name, the same way spanning_tree_modulus maps its own eta_star results), not the round's local component numbering – so a trace is self-contained and doesn't need the intermediate component graphs to be replayed.
| rational<long> discrete_modulus::TraceRound::theta |
| std::vector<Vertex> discrete_modulus::TraceRound::vertices |
the component's vertex set