#include <copy.hpp>
|
| graph_copy_visitor (NewGraph &graph, Copy2OrigIndexMap c, CopyVertex cv, CopyEdge ce) |
|
template<class Vertex , class Graph > |
graph_traits< NewGraph >
::vertex_descriptor | copy_one_vertex (Vertex u) const |
|
template<class Edge , class Graph > |
void | tree_edge (Edge e, const Graph &g_in) const |
|
template<class Edge , class Graph > |
void | non_tree_edge (Edge e, const Graph &g_in) const |
|
graph::bfs_visitor_event_not_overridden | initialize_vertex (Vertex u, Graph &g) |
|
graph::bfs_visitor_event_not_overridden | discover_vertex (Vertex u, Graph &g) |
|
graph::bfs_visitor_event_not_overridden | examine_vertex (Vertex u, Graph &g) |
|
graph::bfs_visitor_event_not_overridden | examine_edge (Edge e, Graph &g) |
|
graph::bfs_visitor_event_not_overridden | tree_edge (Edge e, Graph &g) |
|
graph::bfs_visitor_event_not_overridden | non_tree_edge (Edge e, Graph &g) |
|
graph::bfs_visitor_event_not_overridden | gray_target (Edge e, Graph &g) |
|
graph::bfs_visitor_event_not_overridden | black_target (Edge e, Graph &g) |
|
graph::bfs_visitor_event_not_overridden | finish_vertex (Vertex u, Graph &g) |
|
template<class NewGraph , class Copy2OrigIndexMap , class CopyVertex , class CopyEdge >
template<class NewGraph , class Copy2OrigIndexMap , class CopyVertex , class CopyEdge >
template<class Vertex , class Graph >
template<class NewGraph , class Copy2OrigIndexMap , class CopyVertex , class CopyEdge >
template<class Edge , class Graph >
template<class NewGraph , class Copy2OrigIndexMap , class CopyVertex , class CopyEdge >
template<class Edge , class Graph >
The documentation for this struct was generated from the following file: