A class to implement the behavior of the smallest ring size finding algorithm, accessible through the smallest_ring_size() function below.
More...
|
| | RingSizeVisitor (VD const &source, Graph const &graph, DistanceMap &distances, LabelMap &labels, platform::Size &size, platform::Size const &max_size=2 *999999) |
| |
| bool | tree_edge (Edge const &e, Graph const &g) |
| |
| bool | gray_target (Edge const &e, Graph const &g) |
| |
| template<class Vertex , class Graph > |
| bool | initialize_vertex (Vertex, Graph &) |
| |
| template<class Vertex , class Graph > |
| bool | discover_vertex (Vertex, Graph &) |
| |
| template<class Vertex , class Graph > |
| bool | examine_vertex (Vertex, Graph &) |
| |
| template<class Edge , class Graph > |
| bool | examine_edge (Edge, Graph &) |
| |
| template<class Edge , class Graph > |
| bool | tree_edge (Edge, Graph &) |
| |
| template<class Edge , class Graph > |
| bool | non_tree_edge (Edge, Graph &) |
| |
| template<class Edge , class Graph > |
| bool | gray_target (Edge, Graph &) |
| |
| template<class Edge , class Graph > |
| bool | black_target (Edge, Graph &) |
| |
| template<class Vertex , class Graph > |
| bool | finish_vertex (Vertex, Graph &) |
| |
template<class Graph, class DistanceMap, class LabelMap>
class utility::graph::RingSizeVisitor< Graph, DistanceMap, LabelMap >
A class to implement the behavior of the smallest ring size finding algorithm, accessible through the smallest_ring_size() function below.
Based on BCL's smallest ring size detection algorithm.