 |
Mackey
V3.1
A C++ library for computing RO(G) graded homology
|
|
Mackey
V3.1
A C++ library for computing RO(G) graded homology
|
This is the complete list of members for minimize_color_alteration_and_length< graph_t >, including all inherited members.
| compute_with_root(node_t new_root) | Dikjstra< graph_t, policy_t > | |
| current | Dikjstra< graph_t, policy_t > | protected |
| Dikjstra(const graph_t &G) | Dikjstra< graph_t, policy_t > | protected |
| Dikjstra< graph_t, minimize_color_alteration_and_length< graph_t > > class | minimize_color_alteration_and_length< graph_t > | friend |
| distance_policy | Dikjstra< graph_t, policy_t > | |
| edge_iter_t typedef | Dikjstra< graph_t, policy_t > | |
| G | Dikjstra< graph_t, policy_t > | protected |
| minimize_color_alteration_and_length(const graph_t &G) | minimize_color_alteration_and_length< graph_t > | |
| node_t typedef | minimize_color_alteration_and_length< graph_t > | |
| operator()(node_t a, node_t b) const | Dikjstra< graph_t, policy_t > | |
| paths | Dikjstra< graph_t, policy_t > | |
| previous | Dikjstra< graph_t, policy_t > | protected |
| print_path(std::ostream &os, node_t i) const | Dikjstra< graph_t, policy_t > | |
| root | Dikjstra< graph_t, policy_t > | protected |
| root_per_path | Dikjstra< graph_t, policy_t > |