 |
Mace C++ Graph Library 1.0
The fast and flexible graph library for C++. Developed by Matthias Mace Hädrich.
|
|
Mace C++ Graph Library 1.0
The fast and flexible graph library for C++. Developed by Matthias Mace Hädrich.
|
| add_edge(vertex *p_src, vertex *p_dest, int weight=0) | directed_graph | [virtual] |
| add_edge(vertex *p_src, edge *p_edge) | directed_graph | [virtual] |
| add_vertex(std::string name, int weight=0) | graph | |
| add_vertex(vertex *p_vertex) | graph | |
| are_adjacent(vertex *p_vertex_0, vertex *p_vertex_1) | graph | [protected] |
| are_strongly_adjacent(vertex *p_vertex_0, vertex *p_vertex_1) | directed_graph | |
| directed_graph(std::string name="", bool parallels_allowed=true) | directed_graph | |
| edges_count() | graph | [protected] |
| find_source(edge *p_edge) | graph | [protected] |
| get_vertex_by_name(std::string name) | graph | [protected] |
| graph() | graph | |
| has_loop() | graph | [protected] |
| name() | graph | [protected] |
| parallels_allowed() | graph | [protected] |
| remove_edge(vertex *p_vertex_0, vertex *p_vertex_1) | directed_graph | [virtual] |
| remove_edge(edge *p_edge) | directed_graph | [virtual] |
| remove_edges_pointing_to(vertex *p_vertex) | graph | [protected] |
| remove_vertex(std::string name) | graph | |
| remove_vertex(vertex *p_vertex) | graph | |
| set_name(std::string name) | graph | [protected] |
| set_parallels_allowed(bool allowed) | graph | [protected] |
| vertices() | graph | |
| vertices_count() | graph | [protected] |
| vertices_output(std::ostream &ostream) | graph | |
| ~directed_graph() | directed_graph | |
| ~graph() | graph |
1.7.4
