Home | Documentation | Download | Platforms | Projects | Mailing Lists | Version History

- Main Page
- Classes
- Files
- Related Pages

- Alphabetical List
- Class List
- Class Hierarchy
- Class Members

# graph Member List

This is the complete list of members for graph, including all inherited members.

after_graph_save_handler(ostream *) const | graph | `[inline, virtual]`
all_edges() const | graph |
all_nodes() const | graph |
center() const | graph |
choose_node() const | graph |
clear() | graph |
del_all_edges() | graph |
del_all_nodes() | graph |
del_edge(edge e) | graph |
del_node(node n) | graph |
edges_begin() const | graph |
edges_end() const | graph |
graph() | graph |
graph(const graph &G) | graph |
graph(const graph &G, const list< node > &nodes) | graph |
graph(const graph &G, list< node >::const_iterator it, list< node >::const_iterator end) | graph |
hide_edge(edge e) | graph |
hide_node(node n) | graph |
induced_subgraph(list< node > &subgraph_nodes) | graph |
insert_reverse_edges() | graph |
is_acyclic() const | graph |
is_bidirected(edge_map< edge > &rev) const | graph |
is_connected() const | graph |
is_directed() const | graph |
is_undirected() const | graph |
load(const string &filename, bool preserve_ids=false) | graph | `[inline]`
load(const char *filename, bool preserve_ids=false) | graph |
load_edge_info_handler(edge e, GML_pair *list) | graph | `[virtual]`
load_graph_info_handler(GML_pair *list) | graph | `[virtual]`
load_node_info_handler(node n, GML_pair *list) | graph | `[virtual]`
make_directed() | graph |
make_undirected() | graph |
new_edge(node s, node t) | graph | `[virtual]`
new_node() | graph | `[virtual]`
nodes_begin() const | graph |
nodes_end() const | graph |
number_of_edges() const | graph |
number_of_nodes() const | graph |
post_clear_handler() | graph | `[inline, virtual]`
post_del_edge_handler(node, node) | graph | `[inline, virtual]`
post_del_node_handler() | graph | `[inline, virtual]`
post_hide_edge_handler(edge e) | graph | `[inline, virtual]`
post_hide_node_handler(node n) | graph | `[inline, virtual]`
post_make_directed_handler() | graph | `[inline, virtual]`
post_make_undirected_handler() | graph | `[inline, virtual]`
post_new_edge_handler(edge e) | graph | `[inline, virtual]`
post_new_node_handler(node n) | graph | `[inline, virtual]`
post_restore_edge_handler(edge e) | graph | `[inline, virtual]`
post_restore_node_handler(node n) | graph | `[inline, virtual]`
pre_clear_handler() | graph | `[inline, virtual]`
pre_del_edge_handler(edge e) | graph | `[inline, virtual]`
pre_del_node_handler(node n) | graph | `[inline, virtual]`
pre_graph_save_handler(ostream *os) const | graph | `[inline, virtual]`
pre_hide_edge_handler(edge e) | graph | `[inline, virtual]`
pre_hide_node_handler(node n) | graph | `[inline, virtual]`
pre_make_directed_handler() | graph | `[inline, virtual]`
pre_make_undirected_handler() | graph | `[inline, virtual]`
pre_new_edge_handler(node s, node t) | graph | `[inline, virtual]`
pre_new_node_handler() | graph | `[inline, virtual]`
pre_restore_edge_handler(edge e) | graph | `[inline, virtual]`
pre_restore_node_handler(node n) | graph | `[inline, virtual]`
restore_edge(edge e) | graph |
restore_graph() | graph |
restore_node(node n) | graph |
save(const char *filename) const | graph |
save(ostream *file=&cout) const | graph |
save_edge_info_handler(ostream *, edge) const | graph | `[inline, virtual]`
save_graph_info_handler(ostream *) const | graph | `[inline, virtual]`
save_node_info_handler(ostream *, node) const | graph | `[inline, virtual]`
top_level_key_handler(GML_pair *list) | graph | `[virtual]`
~graph() | graph | `[virtual]`

University of Passau - FMI - Theoretical Computer Science

Design © 2002, 2003 Marcus Raitner, University of Passau