node Class Reference
[Index]
[Hierarchy]
[Headers]
A node in a graph
More...
#include <GTL/node.h>
Public Members
node() [public]
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();
- See Also:
- graph::new_node
int degree() const [public]
Returns the degree of the node, i. e.
node::outdeg + node::indeg .
int outdeg() const [public]
Returns the out degree of the node, i. e. the number of outgoing edges.
int indeg() const [public]
Returns the in degree of the node, i. e. the number of incoming edges.
Returns the node on the opposite side of e
.
- Parameters:
-
e |
an edge incident to the node |
bool is_hidden() const [public]
Returns true iff node is hidden.
- Returns:
-
true iff node is hidden.
- See Also:
- graph::hide_edge, graph::restore_edge
Returns the excentricity of the node, i.e. the maximum graph-theoretic
distance to another node
- Returns:
-
excentricity of node.
adj_nodes_iterator adj_nodes_begin() const [public]
Iterate through all adjacent nodes.
- Returns:
-
start for iteration through all adjacent nodes
adj_nodes_iterator adj_nodes_end() const [public]
Iterate through all adjacent nodes.
- Returns:
-
end for iteration through all adjacent nodes
adj_edges_iterator adj_edges_begin() const [public]
Iterate through all adjacent edges.
- Returns:
-
start for iteration through all adjacent edges
adj_edges_iterator adj_edges_end() const [public]
Iterate through all adjacent edges.
- Returns:
-
end for iteration through all adjacent edges
in_edges_iterator in_edges_begin() const [public]
Iterate through all incoming edges.
- Returns:
-
start for iteration through all incoming edges
in_edges_iterator in_edges_end() const [public]
Iterate through all incoming edges.
- Returns:
-
end for iteration through all incoming edges
out_edges_iterator out_edges_begin() const [public]
Iterate through all outgoing edges.
- Returns:
-
start for iteration through all outgoing edges
out_edges_iterator out_edges_end() const [public]
Iterate through all outgoing edges.
- Returns:
-
end for iteration through all outgoing edges
inout_edges_iterator inout_edges_begin() const [public]
Iterate through all incoming and outgoing edges.
- Returns:
-
start for iteration through all incoming and outgoing edges
inout_edges_iterator inout_edges_end() const [public]
Iterate through all incoming and outgoing edges.
- Returns:
-
end for iteration through all incoming and outgoing edges