#include <graph.hpp>
Public Types | |
| typedef std::map< node_id, node_ptr > | node_map_t |
| typedef std::set< edge_ptr > | edge_list_t |
Public Member Functions | |
| Graph () | |
| ~Graph () | |
| size_t | number_of_nodes () const |
| size_t | number_of_edges () const |
| node_ptr | add_node () |
| node_ptr | add_node (node_id nodeid) |
| void | add_nodes (node_id n) |
| node_ptr | get_node (node_id nodeid) |
| edge_ptr | add_edge (node_id tail, node_id head) |
| edge_ptr | _add_edge (node_ptr node_tail, node_ptr node_head) |
| void | remove_node (node_id nodeid) |
| void | _remove_node (node_ptr u) |
| Graph (Graph &graph) | |
Public Attributes | |
| node_map_t | node_map_ |
| edge_list_t | edge_list_ |
| node_id | next_node_id_ |
| typedef std::set<edge_ptr> pele::Graph::edge_list_t |
| typedef std::map<node_id, node_ptr> pele::Graph::node_map_t |
| pele::Graph::Graph | ( | ) | [inline] |
| pele::Graph::~Graph | ( | ) | [inline] |
| pele::Graph::Graph | ( | Graph & | graph | ) | [inline] |
| edge_ptr pele::Graph::_add_edge | ( | node_ptr | node_tail, |
| node_ptr | node_head | ||
| ) | [inline] |
| void pele::Graph::_remove_node | ( | node_ptr | u | ) | [inline] |
| edge_ptr pele::Graph::add_edge | ( | node_id | tail, |
| node_id | head | ||
| ) | [inline] |
| node_ptr pele::Graph::add_node | ( | ) | [inline] |
| node_ptr pele::Graph::add_node | ( | node_id | nodeid | ) | [inline] |
| void pele::Graph::add_nodes | ( | node_id | n | ) | [inline] |
| node_ptr pele::Graph::get_node | ( | node_id | nodeid | ) | [inline] |
| size_t pele::Graph::number_of_edges | ( | ) | const [inline] |
| size_t pele::Graph::number_of_nodes | ( | ) | const [inline] |
| void pele::Graph::remove_node | ( | node_id | nodeid | ) | [inline] |
1.7.6.1