|
| DynProgSolution (const PCMinMatrix< Compare > &S) |
|
| DynProgSolution (const DynProgSolution &S) |
|
bool | no_solutions () const |
|
void | invalidate () |
|
void | combine_disjoint_union (const DynProgSolution &S) |
|
void | combine_min_of_two (const DynProgSolution &S) |
|
void | destructive_append (DynProgSolution &S) |
|
void | add_edge_global (const VertexName &u, const VertexName &v, const size_t weight) |
|
| PCMinMatrix (const unsigned paths, const unsigned cycles) |
|
| PCMinMatrix (const PathsAndCycles &_max) |
|
| PCMinMatrix (const PCMinMatrix &m) |
|
bool | put (const PathsAndCycles &index, MatrixEntry *ME) |
|
bool | put_empty (const PathsAndCycles &index) |
|
bool | put (const PathsAndCycles &index, const EdgeName &e, const size_t weight) |
|
template<class Graph > |
bool | put_all (const PathsAndCycles &index, const Graph &g) |
|
bool | put (const PathsAndCycles &index, const MatrixEntry &E, const MatrixEntry &cE) |
|
void | add_to_all (const EdgeName &e, const size_t weight) |
|
const MatrixEntry & | get (const PathsAndCycles &index) const |
|
const MatrixEntry & | get (const unsigned paths, const unsigned cycles) const |
|
const MatrixEntry & | at (const PathsAndCycles &index) const |
|
const MatrixEntry & | at (const unsigned paths, const unsigned cycles) const |
|
std::pair< entries_t::const_iterator, entries_t::const_iterator > | get_entries () const |
|
void | destructive_merge (PCMinMatrix< Compare > &pc) |
|
bool | add_to_key (const PathsAndCycles &key, const PathsAndCycles &pc) |
|
void | add_to_each_key (const PathsAndCycles &pc) |
|
PathsAndCycles | find_min_entry_combination_by_iteration (const PathsAndCycles &pc, const PCMinMatrix &m) |
|
PathsAndCycles | find_min_entry_combination_by_testing (const PathsAndCycles &pc, const PCMinMatrix &m) |
|
PathsAndCycles | find_min_entry_combination (const PathsAndCycles &pc, const PCMinMatrix &m) |
|
const MatrixEntry & | get_min_entry () const |
|
const size_t | size () const |
|
const PathsAndCycles | smallest_index () const |
|