|
int | time |
|
std::stack< Node * > | stack |
|
std::vector< std::vector< Node * > > | ctc |
|
std::stack< std::pair< int, int > > | edges_stack |
|
std::vector< Node * > | articulation_points |
|
std::vector< std::pair< Node *, Node * > > | critical_edges |
|
|
std::istream & | operator>> (std::istream &in, Graph &node) |
|
std::ostream & | operator<< (std::ostream &out, Graph &node) |
|
◆ Graph()
◆ get_neighbours()
std::vector< Node * > & Graph::get_neighbours |
( |
const Node & |
node | ) |
|
Intoarce un vector cu toti vecinii unui nod.
◆ get_nodes()
std::vector< Node * > & Graph::get_nodes |
( |
| ) |
|
Intoarce un vector cu toate nodurile din graf.
◆ insert_edge()
void Graph::insert_edge |
( |
Node * |
node1, |
|
|
Node * |
node2 |
|
) |
| |
Construieste o muchie intre cele doua noduri primite ca argument.
◆ insert_node()
void Graph::insert_node |
( |
Node * |
node | ) |
|
Adauga nodul primit ca argument in graf.
◆ node_count()
uint Graph::node_count |
( |
| ) |
const |
Numarul de noduri din graf.
◆ reset()
Removes all temporary information related to the state of the graph during traversals (for example it sets every node as being unvisited)
◆ operator>>
std::istream& operator>> |
( |
std::istream & |
in, |
|
|
Graph & |
node |
|
) |
| |
|
friend |
Convenience overload of the IO operators for pretty printing/reading a graph
Format intrare: – numar de noduri, numar de muchii N M – M linii de tipul (A, B) cu semnficatia – ca exista muchie intre nodurile A si B Node1 Node2 ...
◆ edges
std::vector<std::vector<Node*> > Graph::edges |
|
private |
◆ edges_stack
std::stack<std::pair<int, int> > Graph::edges_stack |
Part II: Structuri auxiliare pentru muchii & noduri critice.
◆ graph_type
GraphType Graph::graph_type |
|
private |
Tipul grafului: orientat/neorientat
◆ nodes
std::vector<Node*> Graph::nodes |
|
private |
◆ stack
std::stack<Node*> Graph::stack |
Part I: Structuri auxiliare pentru determinarea componentelor tare conexe
The documentation for this class was generated from the following files: