|
template<typename Graph > |
void | tu::util::reconnect_edge_target (Graph &graph, typename boost::graph_traits< Graph >::edge_descriptor edge, typename boost::graph_traits< Graph >::vertex_descriptor old_vertex, typename boost::graph_traits< Graph >::vertex_descriptor new_vertex) |
|
template<typename Graph > |
void | tu::util::reconnect_edge_source (Graph &graph, typename boost::graph_traits< Graph >::edge_descriptor edge, typename boost::graph_traits< Graph >::vertex_descriptor old_vertex, typename boost::graph_traits< Graph >::vertex_descriptor new_vertex) |
|
template<typename Graph > |
void | tu::util::reconnect_edge (Graph &graph, typename boost::graph_traits< Graph >::edge_descriptor edge, typename boost::graph_traits< Graph >::vertex_descriptor old_vertex, typename boost::graph_traits< Graph >::vertex_descriptor new_vertex) |
|
template<typename OutputIterator , typename EventTag > |
vertex_writer< OutputIterator, EventTag > | tu::util::detail::write_vertex (OutputIterator iterator, EventTag tag) |
|
template<typename Graph , typename IndexMap , typename VertexSequence > |
bool | tu::util::is_path (const Graph &graph, const IndexMap index_map, VertexSequence &path) |
|
template<typename Graph , typename IndexMap > |
bool | tu::util::is_path (const Graph &graph, const IndexMap index_map) |
|
template<typename Graph > |
bool | tu::util::is_path (const Graph &g) |
|
template<typename Graph , typename IndexMap , typename Vertex > |
bool | tu::util::find_star_vertex (const Graph &graph, const IndexMap index_map, Vertex &vertex) |
|
template<typename Graph , typename Vertex > |
bool | tu::util::find_star_vertex (const Graph &graph, Vertex &vertex) |
|
template<typename Graph , typename IndexMap > |
bool | tu::util::is_star (const Graph &graph, const IndexMap index_map) |
|
template<typename Graph > |
bool | tu::util::is_star (const Graph &graph) |
|
template<typename Graph , typename VertexSet > |
void | tu::util::used_vertices (const Graph &graph, VertexSet &vertex_set) |
|