Polymake Template Library (PTL)  3.5
pm::graph::Graph< TDir > Member List

This is the complete list of members for pm::graph::Graph< TDir >, including all inherited members.

add_edge(int n1, int n2)pm::graph::Graph< TDir >inline
add_node()pm::graph::Graph< TDir >inline
adjacent_nodes(int n)pm::graph::Graph< TDir >inline
adjacent_nodes(int n) constpm::graph::Graph< TDir >inline
all_edges(int n1, int n2)pm::graph::Graph< TDir >inline
all_edges(int n1, int n2) constpm::graph::Graph< TDir >inline
clear(int n=0)pm::graph::Graph< TDir >inline
const_node_container_ref typedefpm::graph::Graph< TDir >
contract_edge(int n1, int n2)pm::graph::Graph< TDir >inline
copy_permuted(const TPerm &perm, const TInvPerm &inv_perm) constpm::graph::Graph< TDir >inline
degree(int n) constpm::graph::Graph< TDir >inline
delete_all_edges(int n1, int n2)pm::graph::Graph< TDir >inline
delete_edge(int n1, int n2)pm::graph::Graph< TDir >inline
delete_edge(const parallel_edge_iterator &where)pm::graph::Graph< TDir >inline
delete_node(int n)pm::graph::Graph< TDir >inline
dim() constpm::graph::Graph< TDir >inline
edge(int n1, int n2)pm::graph::Graph< TDir >inline
edge(int n1, int n2) constpm::graph::Graph< TDir >inline
edge_exists(int n1, int n2) constpm::graph::Graph< TDir >inline
edges() constpm::graph::Graph< TDir >inline
enumerate_edges() constpm::graph::Graph< TDir >inline
Graph()pm::graph::Graph< TDir >inline
Graph(int n)pm::graph::Graph< TDir >inlineexplicit
has_gaps() constpm::graph::Graph< TDir >inline
in_adjacent_nodes(int n)pm::graph::Graph< TDir >inline
in_adjacent_nodes(int n) constpm::graph::Graph< TDir >inline
in_degree(int n) constpm::graph::Graph< TDir >inline
in_edges(int n)pm::graph::Graph< TDir >inline
in_edges(int n) constpm::graph::Graph< TDir >inline
invalid_node(int n) constpm::graph::Graph< TDir >inline
node_container typedefpm::graph::Graph< TDir >
node_container_ref typedefpm::graph::Graph< TDir >
node_exists(int n) constpm::graph::Graph< TDir >inline
node_out_of_range(int n) constpm::graph::Graph< TDir >inline
nodes() constpm::graph::Graph< TDir >inline
operator=(const Graph &G2)pm::graph::Graph< TDir >inline
operator=(const GenericGraph< Graph > &G2)pm::graph::Graph< TDir >inline
operator=(const GenericGraph< Graph2, TDir2 > &G2)pm::graph::Graph< TDir >inline
out_adjacent_nodes(int n)pm::graph::Graph< TDir >inline
out_adjacent_nodes(int n) constpm::graph::Graph< TDir >inline
out_degree(int n) constpm::graph::Graph< TDir >inline
out_edges(int n)pm::graph::Graph< TDir >inline
out_edges(int n) constpm::graph::Graph< TDir >inline
permute_inv_nodes(const TInvPerm &inv_perm)pm::graph::Graph< TDir >inline
permute_nodes(const TPerm &perm)pm::graph::Graph< TDir >inline
relocate(Graph *from, Graph *to)pm::graph::Graph< TDir >friend
renumber_nodes(const Graph &me)pm::graph::Graph< TDir >friend
resize(int n)pm::graph::Graph< TDir >inline
squeeze()pm::graph::Graph< TDir >inline
swap(Graph &G)pm::graph::Graph< TDir >inline