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

after_graph_save_handler(ostream *) const	graph	inlinevirtual
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
edge_iterator typedef	graph
edges_begin() const	graph
edges_end() const	graph
GetEdgeValue(edge n) const	my_graph	inline
GetEdgeValue(edge n) const	my_graph	inline
GetNodeValue(node n) const	my_graph	inline
GetNodeValue(node n) const	my_graph	inline
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
my_graph()	my_graph	inline
my_graph()	my_graph	inline
new_edge(node s, node t)	graph	virtual
new_edge(const list< node > &sources, const list< node > &targets)	graph	virtual
new_node()	graph	virtual
new_parton(node s, node t, int p)	my_graph	inline
new_parton(node s, node t, int p)	my_graph	inline
new_vertex(int x)	my_graph	inline
new_vertex(int x)	my_graph	inline
node_iterator typedef	graph
nodes_begin() const	graph
nodes_end() const	graph
number_of_edges() const	graph
number_of_ids(node) const	graph
number_of_ids(edge) const	graph
number_of_nodes() const	graph
P	my_graph	private
post_clear_handler()	graph	inlinevirtual
post_del_edge_handler(node, node)	graph	inlinevirtual
post_del_node_handler()	graph	inlinevirtual
post_hide_edge_handler(edge e)	graph	inlinevirtual
post_hide_node_handler(node n)	graph	inlinevirtual
post_make_directed_handler()	graph	inlinevirtual
post_make_undirected_handler()	graph	inlinevirtual
post_new_edge_handler(edge e)	graph	inlinevirtual
post_new_node_handler(node n)	graph	inlinevirtual
post_restore_edge_handler(edge e)	graph	inlinevirtual
post_restore_node_handler(node n)	graph	inlinevirtual
pre_clear_handler()	graph	inlinevirtual
pre_del_edge_handler(edge e)	graph	inlinevirtual
pre_del_node_handler(node n)	graph	inlinevirtual
pre_graph_save_handler(ostream *os) const	graph	inlinevirtual
pre_hide_edge_handler(edge e)	graph	inlinevirtual
pre_hide_node_handler(node n)	graph	inlinevirtual
pre_make_directed_handler()	graph	inlinevirtual
pre_make_undirected_handler()	graph	inlinevirtual
pre_new_edge_handler(node s, node t)	graph	inlinevirtual
pre_new_node_handler()	graph	inlinevirtual
pre_restore_edge_handler(edge e)	graph	inlinevirtual
pre_restore_node_handler(node n)	graph	inlinevirtual
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 *o, edge n) const	my_graph	inlinevirtual
save_edge_info_handler(ostream *o, edge n) const	my_graph	inlinevirtual
save_graph_info_handler(ostream *) const	graph	inlinevirtual
save_node_info_handler(ostream *o, node n) const	my_graph	inlinevirtual
save_node_info_handler(ostream *o, node n) const	my_graph	inlinevirtual
top_level_key_handler(GML_pair *list)	graph	virtual
X	my_graph	private
~graph()	graph	virtual