|
| GraphInfos (const Graph &_g, const bool update_values=false) |
|
| GraphInfos (const Graph &_g, const GraphInfos &infos, const Matching< Graph > &translate) |
|
void | invalidate_all () |
|
void | update_all (const bool force=false) |
|
void | add_vertex (const Vertex< Graph > &u) |
|
void | add_edge (const Vertex< Graph > &u, const Vertex< Graph > &v) |
|
void | delete_edge (const VertexPair< Graph > &uv) |
|
void | read_from_infos (const GraphInfos< Graph > &infos, const Matching< Graph > &translate) |
|
void | read_from_split_off_component (const GraphInfos< Graph > &infos, const Matching< Graph > &translate) |
|
void | update_disjoint_union (const GraphInfos< Graph > &infos, const Matching< Graph > &translate) |
|
PathsAndCycles | get_paths_and_cycles () |
|
PathsAndCycles | get_paths_and_cycles_const () const |
|
unsigned | get_FES () |
|
unsigned | get_FES_const () const |
|
bool | is_acyclic () |
|
bool | is_acyclic_const () const |
|
bool | is_max_deg_two () |
|
bool | is_max_deg_two_const () const |
|
|
PathsAndCycles | _get_paths_and_cycles (const unsigned cc) |
|
bool | is_max_deg_two_easy_cases () const |
|
The documentation for this struct was generated from the following file: