24 std::vector<Node*> nodes;
25 std::vector<std::vector<Node*> > edges;
26 std::map<std::string, Node*> social_network;
34 Graph(GraphType type);
61 std::vector<std::vector<Node*> > ctc;
63 void print_ctc()
const;
67 std::vector<Node*> articulation_points;
68 std::vector<std::pair<Node*, Node*> > critical_edges;
72 friend std::ostream& operator<<(std::ostream& out,
Graph& node);
void insert_node(Node *node)
Definition: Graph.cpp:31
void reset()
Definition: Graph.cpp:51
friend std::istream & operator>>(std::istream &in, Graph &node)
Definition: Graph.cpp:119
void check_node(Node &node) const
Definition: Graph.cpp:70
GraphType graph_type
Definition: Graph.h:22
uint node_count() const
Definition: Graph.cpp:27
Graph()
Definition: Graph.cpp:11
std::vector< Node * > & get_edges(Node &node)
Definition: Graph.cpp:46
std::vector< Node * > & get_nodes()
Definition: Graph.cpp:42
std::stack< std::pair< int, int > > edges_stack
Definition: Graph.h:66
void insert_edge(Node *node1, Node *node2)
Definition: Graph.cpp:37
std::stack< Node * > stack
Definition: Graph.h:60