Digikam::Graph< VertexProperties, EdgeProperties >::GraphSearch Class Reference

#include <itemhistorygraph_boost.h>

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)

Detailed Description

template<class VertexProperties, class EdgeProperties>
class Digikam::Graph< VertexProperties, EdgeProperties >::GraphSearch

Definition at line 1362 of file itemhistorygraph_boost.h.

Member Function Documentation

template<class VertexProperties , class EdgeProperties >

template<class GraphType >

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

inline

Definition at line 1416 of file itemhistorygraph_boost.h.

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.

Definition at line 1517 of file itemhistorygraph_boost.h.

template<class VertexProperties , class EdgeProperties >

template<class GraphType >

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

inline

Definition at line 1367 of file itemhistorygraph_boost.h.

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

Definition at line 1390 of file itemhistorygraph_boost.h.

Member Data Documentation

template<class VertexProperties , class EdgeProperties >

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

Definition at line 1487 of file itemhistorygraph_boost.h.

---

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

• itemhistorygraph_boost.h