NRP Core  1.4.1
NGraph::tGraph< T > Member List

This is the complete list of members for NGraph::tGraph< T >, including all inherited members.

absorb(iterator pa, iterator pb)NGraph::tGraph< T >inline
absorb(vertex a, vertex b)NGraph::tGraph< T >inline
adj_graph typedefNGraph::tGraph< T >
begin()NGraph::tGraph< T >inline
begin() constNGraph::tGraph< T >inline
clear()NGraph::tGraph< T >inline
COMMENT enum valueNGraph::tGraph< T >
const_edge_iterator typedefNGraph::tGraph< T >
const_iterator typedefNGraph::tGraph< T >
const_node_iterator typedefNGraph::tGraph< T >
const_vertex_iterator typedefNGraph::tGraph< T >
degree(const vertex &a) constNGraph::tGraph< T >inline
degree(const_iterator p)NGraph::tGraph< T >inlinestatic
degree(iterator p)NGraph::tGraph< T >inlinestatic
edge typedefNGraph::tGraph< T >
EDGE enum valueNGraph::tGraph< T >
edge_iterator typedefNGraph::tGraph< T >
edge_list() constNGraph::tGraph< T >
edge_set typedefNGraph::tGraph< T >
EMPTY enum valueNGraph::tGraph< T >
end()NGraph::tGraph< T >inline
end() constNGraph::tGraph< T >inline
find(const vertex &a)NGraph::tGraph< T >inline
find(const vertex &a) constNGraph::tGraph< T >inline
in_begin(const_iterator p)NGraph::tGraph< T >inlinestatic
in_degree(const vertex &a) constNGraph::tGraph< T >inline
in_degree(const_iterator p)NGraph::tGraph< T >inlinestatic
in_degree(iterator p)NGraph::tGraph< T >inlinestatic
in_end(const_iterator p)NGraph::tGraph< T >inlinestatic
in_neighbors(const vertex &a) constNGraph::tGraph< T >inline
in_neighbors(const vertex &a)NGraph::tGraph< T >inline
in_neighbors(const_iterator p)NGraph::tGraph< T >inlinestatic
in_neighbors(iterator p)NGraph::tGraph< T >inlinestatic
in_out_edge_sets typedefNGraph::tGraph< T >
includes_edge(const vertex &a, const vertex &b) constNGraph::tGraph< T >inline
includes_edge(const edge &e) constNGraph::tGraph< T >inline
includes_vertex(const vertex &a) constNGraph::tGraph< T >inline
insert_edge(iterator pa, iterator pb)NGraph::tGraph< T >inline
insert_edge(const vertex &a, const vertex &b)NGraph::tGraph< T >inline
insert_edge(const edge &E)NGraph::tGraph< T >inline
insert_edge_noloop(iterator pa, iterator pb)NGraph::tGraph< T >inline
insert_edge_noloop(const vertex &a, const vertex &b)NGraph::tGraph< T >inline
insert_new_vertex_inout_list(const vertex &a, const vertex_set &IN, const vertex_set &OUT)NGraph::tGraph< T >inline
insert_undirected_edge(const vertex &a, const vertex &b)NGraph::tGraph< T >inline
insert_undirected_edge(const edge &E)NGraph::tGraph< T >inline
insert_vertex(const vertex &a)NGraph::tGraph< T >inline
intersect(const tGraph &B) constNGraph::tGraph< T >inline
is_directed() constNGraph::tGraph< T >inline
is_undirected() constNGraph::tGraph< T >inline
isolated(const vertex &a) constNGraph::tGraph< T >inline
isolated(const_iterator p)NGraph::tGraph< T >inlinestatic
isolated(iterator p)NGraph::tGraph< T >inlinestatic
iterator typedefNGraph::tGraph< T >
line_type enum nameNGraph::tGraph< T >
minus(const tGraph &B) constNGraph::tGraph< T >inline
node(const_iterator p)NGraph::tGraph< T >inlinestatic
node(iterator p)NGraph::tGraph< T >inlinestatic
node(const_vertex_iterator p)NGraph::tGraph< T >inlinestatic
node_iterator typedefNGraph::tGraph< T >
num_edges() constNGraph::tGraph< T >inline
num_edges(const_iterator p)NGraph::tGraph< T >inlinestatic
num_edges(iterator p)NGraph::tGraph< T >inlinestatic
num_nodes() constNGraph::tGraph< T >inline
num_vertices() constNGraph::tGraph< T >inline
operator*(const tGraph &B) constNGraph::tGraph< T >inline
operator+(const tGraph &B) constNGraph::tGraph< T >inline
operator+=(const tGraph &B)NGraph::tGraph< T >inline
operator-(const tGraph &B) constNGraph::tGraph< T >inline
out_begin(const_iterator p)NGraph::tGraph< T >inlinestatic
out_begin(iterator p)NGraph::tGraph< T >inlinestatic
out_degree(const vertex &a) constNGraph::tGraph< T >inline
out_degree(const_iterator p)NGraph::tGraph< T >inlinestatic
out_degree(iterator p)NGraph::tGraph< T >inlinestatic
out_end(const_iterator p)NGraph::tGraph< T >inlinestatic
out_neighbors(const vertex &a) constNGraph::tGraph< T >inline
out_neighbors(const vertex &a)NGraph::tGraph< T >inline
out_neighbors(const_iterator p)NGraph::tGraph< T >inlinestatic
out_neighbors(iterator p)NGraph::tGraph< T >inlinestatic
out_neighbors_begin(const vertex &a)NGraph::tGraph< T >inline
out_neighbors_begin(const vertex &a) constNGraph::tGraph< T >inline
out_neighbors_end(const vertex &a)NGraph::tGraph< T >inline
out_neighbors_end(const vertex &a) constNGraph::tGraph< T >inline
plus(const tGraph &B) constNGraph::tGraph< T >inline
plus_eq(const tGraph &B)NGraph::tGraph< T >inline
print() constNGraph::tGraph< T >
read_line(std::istream &s, T &v1, T &v2, std::string &line, line_type &t)NGraph::tGraph< T >inlinestatic
remove_edge(iterator pa, iterator pb)NGraph::tGraph< T >inline
remove_edge(const vertex &a, const vertex &b)NGraph::tGraph< T >inline
remove_edge(const edge &E)NGraph::tGraph< T >inline
remove_undirected_edge(const vertex &a, const vertex &b)NGraph::tGraph< T >inline
remove_undirected_edge(const edge &e)NGraph::tGraph< T >inline
remove_vertex(iterator pa)NGraph::tGraph< T >inline
remove_vertex(const vertex &a)NGraph::tGraph< T >inline
remove_vertex_set(const vertex_set &V)NGraph::tGraph< T >inline
set_undirected()NGraph::tGraph< T >inline
smart_absorb(iterator pa, iterator pb)NGraph::tGraph< T >inline
smart_absorb(vertex a, vertex b)NGraph::tGraph< T >inline
subgraph(const vertex_set &A) constNGraph::tGraph< T >inline
subgraph_size(const vertex_set &A) constNGraph::tGraph< T >inline
subgraph_sparsity(const vertex_set &A) constNGraph::tGraph< T >inline
tGraph()NGraph::tGraph< T >inline
tGraph(std::istream &s)NGraph::tGraph< T >inline
tGraph(const tGraph &B)NGraph::tGraph< T >inline
tGraph(const edge_set &E)NGraph::tGraph< T >inline
value_type typedefNGraph::tGraph< T >
vertex typedefNGraph::tGraph< T >
VERTEX enum valueNGraph::tGraph< T >
vertex_iterator typedefNGraph::tGraph< T >
vertex_neighbor_const_iterator typedefNGraph::tGraph< T >
vertex_neighbor_iterator typedefNGraph::tGraph< T >
vertex_set typedefNGraph::tGraph< T >