Home | Documentation | Download | Platforms | Projects | Mailing Lists | Version History
Public Member Functions | |
node () | |
int | degree () const |
int | outdeg () const |
int | indeg () const |
const node & | opposite (edge e) const |
bool | is_hidden () const |
int | excentricity () const |
adj_nodes_iterator | adj_nodes_begin () const |
adj_nodes_iterator | adj_nodes_end () const |
adj_edges_iterator | adj_edges_begin () const |
adj_edges_iterator | adj_edges_end () const |
in_edges_iterator | in_edges_begin () const |
in_edges_iterator | in_edges_end () const |
out_edges_iterator | out_edges_begin () const |
out_edges_iterator | out_edges_end () const |
inout_edges_iterator | inout_edges_begin () const |
inout_edges_iterator | inout_edges_end () const |
Friends | |
class | graph |
class | edge |
Iterator for adjacent nodes of a node.
Iterator for all incident edges of a node.
Iterator for adjacent edges of a node.
node::node | ( | ) |
Default constructor. Creates an invalid node. The only way to obtain a valid node is through graph::new_node Example:
graph g; node n;
n = g.new_node();
int node::degree | ( | ) | const |
Returns the degree of the node, i. e. node::outdeg + node::indeg .
int node::outdeg | ( | ) | const |
Returns the out degree of the node, i. e. the number of outgoing edges.
int node::indeg | ( | ) | const |
Returns the in degree of the node, i. e. the number of incoming edges.
bool node::is_hidden | ( | ) | const |
int node::excentricity | ( | ) | const |
adj_nodes_iterator node::adj_nodes_begin | ( | ) | const |
Iterate through all adjacent nodes.
adj_nodes_iterator node::adj_nodes_end | ( | ) | const |
Iterate through all adjacent nodes.
adj_edges_iterator node::adj_edges_begin | ( | ) | const |
Iterate through all adjacent edges.
adj_edges_iterator node::adj_edges_end | ( | ) | const |
Iterate through all adjacent edges.
in_edges_iterator node::in_edges_begin | ( | ) | const |
Iterate through all incoming edges.
in_edges_iterator node::in_edges_end | ( | ) | const |
Iterate through all incoming edges.
out_edges_iterator node::out_edges_begin | ( | ) | const |
Iterate through all outgoing edges.
out_edges_iterator node::out_edges_end | ( | ) | const |
Iterate through all outgoing edges.
inout_edges_iterator node::inout_edges_begin | ( | ) | const |
Iterate through all incoming and outgoing edges.
inout_edges_iterator node::inout_edges_end | ( | ) | const |
Iterate through all incoming and outgoing edges.
University of Passau - FMI - Theoretical Computer Science