digiKam
Classes | Public Member Functions | Public Attributes | Protected Member Functions | List of all members
Digikam::Graph< VertexProperties, EdgeProperties >::GraphSearch Class Reference

Classes

class  BreadthFirstSearchVisitor
 
class  CommonVisitor
 
class  DepthFirstSearchVisitor
 
class  lessThanMapEdgeToTarget
 

Public Member Functions

template<class GraphType >
void breadthFirstSearch (const GraphType &graph, const Vertex &v, bool invertGraph)
 
template<class GraphType >
void depthFirstSearch (const GraphType &graph, const Vertex &v, bool invertGraph)
 
template<class GraphType , typename LessThan >
void depthFirstSearchSorted (const GraphType &graph, const Vertex &v, bool invertGraph, LessThan lessThan)
 

Public Attributes

QList< Vertex > vertices
 

Protected Member Functions

template<class IncidenceGraph , class DFSVisitor , class ColorMap , typename LessThan >
void depth_first_search_sorted (const IncidenceGraph &g, Vertex u, DFSVisitor &vis, ColorMap color, LessThan lessThan)
 This is boost's simple, old, recursive DFS algorithm adapted with lessThan. More...
 

Member Function Documentation

◆ breadthFirstSearch()

template<class VertexProperties , class EdgeProperties >
template<class GraphType >
void Digikam::Graph< VertexProperties, EdgeProperties >::GraphSearch::breadthFirstSearch ( const GraphType &  graph,
const Vertex &  v,
bool  invertGraph 
)
inline

Referenced by Digikam::Graph< VertexProperties, EdgeProperties >::findZeroDegreeFrom(), Digikam::Graph< VertexProperties, EdgeProperties >::verticesBreadthFirst(), and Digikam::Graph< VertexProperties, EdgeProperties >::verticesDominatedBy().

◆ depth_first_search_sorted()

template<class VertexProperties , class EdgeProperties >
template<class IncidenceGraph , class DFSVisitor , class ColorMap , typename LessThan >
void Digikam::Graph< VertexProperties, EdgeProperties >::GraphSearch::depth_first_search_sorted ( const IncidenceGraph &  g,
Vertex  u,
DFSVisitor &  vis,
ColorMap  color,
LessThan  lessThan 
)
inlineprotected

This is boost's simple, old, recursive DFS algorithm adapted with lessThan.

Sort edges. The lessThan we have takes vertices, so we use a lessThan which maps the given edges to their targets, and calls our vertex lessThan.

◆ depthFirstSearch()

template<class VertexProperties , class EdgeProperties >
template<class GraphType >
void Digikam::Graph< VertexProperties, EdgeProperties >::GraphSearch::depthFirstSearch ( const GraphType &  graph,
const Vertex &  v,
bool  invertGraph 
)
inline

Referenced by Digikam::Graph< VertexProperties, EdgeProperties >::verticesDominatedBy().

◆ depthFirstSearchSorted()

template<class VertexProperties , class EdgeProperties >
template<class GraphType , typename LessThan >
void Digikam::Graph< VertexProperties, EdgeProperties >::GraphSearch::depthFirstSearchSorted ( const GraphType &  graph,
const Vertex &  v,
bool  invertGraph,
LessThan  lessThan 
)
inline

Referenced by Digikam::Graph< VertexProperties, EdgeProperties >::verticesDepthFirstSorted().

Member Data Documentation

◆ vertices

template<class VertexProperties , class EdgeProperties >
QList<Vertex> Digikam::Graph< VertexProperties, EdgeProperties >::GraphSearch::vertices

Referenced by Digikam::Graph< VertexProperties, EdgeProperties >::findZeroDegreeFrom(), Digikam::Graph< VertexProperties, EdgeProperties >::verticesBreadthFirst(), Digikam::Graph< VertexProperties, EdgeProperties >::verticesDepthFirstSorted(), and Digikam::Graph< VertexProperties, EdgeProperties >::verticesDominatedBy().

The documentation for this class was generated from the following file: