28 std::vector<std::vector<Node*> >
edges;
33 Graph(GraphType type);
60 std::vector<std::vector<Node*> > ctc;
62 void print_ctc()
const;
66 std::vector<Node*> articulation_points;
67 std::vector<std::pair<Node*, Node*> > critical_edges;
71 friend std::ostream& operator<<(std::ostream& out,
Graph& node);
std::vector< Node * > & get_neighbours(const Node &node)
Definition: graph.cpp:42
void insert_node(Node *node)
Definition: graph.cpp:29
void reset()
Definition: graph.cpp:46
friend std::istream & operator>>(std::istream &in, Graph &node)
Definition: graph.cpp:102
GraphType graph_type
Definition: graph.h:22
std::vector< std::vector< Node * > > edges
Definition: graph.h:28
uint node_count() const
Definition: graph.cpp:25
Graph()
Definition: graph.cpp:11
std::vector< Node * > & get_nodes()
Definition: graph.cpp:38
std::stack< std::pair< int, int > > edges_stack
Definition: graph.h:65
void insert_edge(Node *node1, Node *node2)
Definition: graph.cpp:34
std::vector< Node * > nodes
Definition: graph.h:25
std::stack< Node * > stack
Definition: graph.h:59