Polymake Template Library (PTL) 4.13
polymake::Graph< TDir > Member List

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

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