![]() |
OR-Tools
8.2
|
Definition at line 141 of file topologicalsorter.h.
Public Types | |
typedef std::vector< int > | AdjacencyList |
Public Member Functions | |
DenseIntTopologicalSorterTpl () | |
DenseIntTopologicalSorterTpl (int num_nodes) | |
void | AddNode (int node_index) |
void | AddEdge (int from, int to) |
bool | GetNext (int *next_node_index, bool *cyclic, std::vector< int > *output_cycle_nodes=NULL) |
int | GetCurrentFringeSize () |
void | StartTraversal () |
bool | TraversalStarted () const |
void | ExtractCycle (std::vector< int > *cycle_nodes) const |
Static Public Member Functions | |
static int | RemoveDuplicates (std::vector< AdjacencyList > *lists, int skip_lists_smaller_than) |
typedef std::vector<int> AdjacencyList |
Definition at line 144 of file topologicalsorter.h.
|
inline |
Definition at line 148 of file topologicalsorter.h.
|
inlineexplicit |
Definition at line 156 of file topologicalsorter.h.
void AddEdge | ( | int | from, |
int | to | ||
) |
Definition at line 64 of file topologicalsorter.cc.
void AddNode | ( | int | node_index | ) |
Definition at line 44 of file topologicalsorter.cc.
void ExtractCycle | ( | std::vector< int > * | cycle_nodes | ) | const |
Definition at line 219 of file topologicalsorter.cc.
|
inline |
Definition at line 179 of file topologicalsorter.h.
bool GetNext | ( | int * | next_node_index, |
bool * | cyclic, | ||
std::vector< int > * | output_cycle_nodes = NULL |
||
) |
Definition at line 95 of file topologicalsorter.cc.
|
static |
Definition at line 169 of file topologicalsorter.cc.
void StartTraversal |
Definition at line 136 of file topologicalsorter.cc.
|
inline |
Definition at line 186 of file topologicalsorter.h.