#include <db_graph.h>

Inheritance diagram for DBGraph:

Collaboration diagram for DBGraph:

Classes
class	edge_iterator

struct	EdgePredicate

class	vertex_iterator

struct	VertexPredicate

struct	VisitorFilter

Public Types
typedef DBGraphBase::edge_descriptor	Edge

typedef DBGraphBase::vertex_descriptor	Vertex

typedef boost::function< void(DBGraphVertex *)>	VertexVisitor

typedef boost::function< void(DBGraphEdge *)>	EdgeVisitor

typedef boost::function< void(DBGraphVertex *)>	VertexFinish

typedef boost::tuple< DBGraphVertex , DBGraphVertex , DBGraphEdge * >	DBEdgeInfo

Public Types inherited from DBGraphBase
typedef boost::adjacency_list< ordered_set_by_nameS, boost::listS, boost::undirectedS, VertexProperties, EdgeProperties >	graph_t

typedef boost::graph_traits< graph_t >::vertex_descriptor	vertex_descriptor

typedef boost::graph_traits< graph_t >::edge_descriptor	edge_descriptor

typedef boost::graph_traits< graph_t >::adjacency_iterator	adjacency_iterator

typedef boost::graph_traits< graph_t >::edge_iterator	edge_iterator

typedef boost::graph_traits< graph_t >::out_edge_iterator	out_edge_iterator

typedef graph_t::StoredEdge	StoredEdge

typedef boost::container_gen< graph_t::out_edge_list_selector, StoredEdge >::type	OutEdgeListType

typedef OutEdgeListType::iterator	OutEdgeIterator

typedef graph_t::EdgeContainer	EdgeContainer

typedef EdgeContainer::value_type	EdgeType

Public Member Functions
void	AddNode (DBGraphVertex *entry)

void	RemoveNode (DBGraphVertex *entry)

Edge	Link (DBGraphVertex lhs, DBGraphVertex rhs, DBGraphEdge *link)

void	Unlink (DBGraphEdge *link)

const graph_t *	graph () const

DBGraphVertex *	vertex_data (DBGraphBase::vertex_descriptor vertex) const

const std::string	edge_name (DBGraph::Edge edge) const

DBGraphEdge *	edge_data (DBGraph::Edge edge) const

void	Visit (DBGraphVertex *start, VertexVisitor vertex_visit_fn, EdgeVisitor edge_visit_fn)

void	Visit (DBGraphVertex *start, VertexVisitor vertex_visit_fn, EdgeVisitor edge_visit_fn, const VisitorFilter &filter)

void	Visit (DBGraphVertex *start, VertexVisitor vertex_visit_fn, EdgeVisitor edge_visit_fn, VertexFinish vertex_finish_fn)

edge_iterator	edge_list_begin ()

edge_iterator	edge_list_end ()

vertex_iterator	vertex_list_begin ()

vertex_iterator	vertex_list_end ()

void	clear ()

size_t	vertex_count () const

size_t	edge_count () const

Public Member Functions inherited from DBGraphBase
	DBGraphBase ()

uint64_t	get_graph_walk_num ()

Private Types
typedef std::queue< DBGraphVertex * >	VisitQ

Private Member Functions
void	IterateEdges (DBGraphVertex *start, OutEdgeIterator &iter_begin, OutEdgeIterator &iter_end, VertexVisitor vertex_visit_fn, EdgeVisitor edge_visit_fn, EdgePredicate &edge_test, VertexPredicate &vertex_test, uint64_t curr_walk, VisitQ &visit_queue, bool match_name=false, const std::string &allowed_edge="")

DBGraphVertex *	vertex_target (DBGraphVertex current_vertex, DBGraphEdge edge)

Private Attributes
graph_t	graph_

Detailed Description

Definition at line 18 of file db_graph.h.

Member Typedef Documentation

◆ DBEdgeInfo

typedef boost::tuple<DBGraphVertex *, DBGraphVertex *, DBGraphEdge *> DBGraph::DBEdgeInfo

Definition at line 45 of file db_graph.h.

◆ Edge

typedef DBGraphBase::edge_descriptor DBGraph::Edge

Definition at line 20 of file db_graph.h.

◆ EdgeVisitor

typedef boost::function<void(DBGraphEdge *)> DBGraph::EdgeVisitor

Definition at line 23 of file db_graph.h.

◆ Vertex

typedef DBGraphBase::vertex_descriptor DBGraph::Vertex

Definition at line 21 of file db_graph.h.

◆ VertexFinish

typedef boost::function<void(DBGraphVertex *)> DBGraph::VertexFinish

Definition at line 24 of file db_graph.h.

◆ VertexVisitor

typedef boost::function<void(DBGraphVertex *)> DBGraph::VertexVisitor

Definition at line 22 of file db_graph.h.

◆ VisitQ

typedef std::queue<DBGraphVertex *> DBGraph::VisitQ

private

Definition at line 124 of file db_graph.h.

Member Function Documentation

◆ AddNode()

void DBGraph::AddNode ( DBGraphVertex * entry )

Definition at line 30 of file db_graph.cc.

Here is the call graph for this function:

◆ clear()

void DBGraph::clear ( )

Definition at line 301 of file db_graph.cc.

◆ edge_count()

size_t DBGraph::edge_count ( ) const

Definition at line 309 of file db_graph.cc.

◆ edge_data()

DBGraphEdge* DBGraph::edge_data ( DBGraph::Edge edge ) const

inline

Definition at line 101 of file db_graph.h.

◆ edge_list_begin()

DBGraph::edge_iterator DBGraph::edge_list_begin ( )

Definition at line 262 of file db_graph.cc.

◆ edge_list_end()

DBGraph::edge_iterator DBGraph::edge_list_end ( )

Definition at line 266 of file db_graph.cc.

◆ edge_name()

const std::string DBGraph::edge_name ( DBGraph::Edge edge ) const

inline

Definition at line 97 of file db_graph.h.

◆ graph()

const graph_t* DBGraph::graph ( ) const

inline

Definition at line 91 of file db_graph.h.

◆ IterateEdges()

void DBGraph::IterateEdges	(	DBGraphVertex *	start,
		OutEdgeIterator &	iter_begin,
		OutEdgeIterator &	iter_end,
		VertexVisitor	vertex_visit_fn,
		EdgeVisitor	edge_visit_fn,
		EdgePredicate &	edge_test,
		VertexPredicate &	vertex_test,
		uint64_t	curr_walk,
		VisitQ &	visit_queue,
		bool	match_name = `false`,
		const std::string &	allowed_edge = `""`
	)

private

Definition at line 164 of file db_graph.cc.

Here is the call graph for this function:

◆ Link()

DBGraph::Edge DBGraph::Link	(	DBGraphVertex *	lhs,
		DBGraphVertex *	rhs,
		DBGraphEdge *	link
	)

Definition at line 41 of file db_graph.cc.

Here is the call graph for this function:

◆ RemoveNode()

void DBGraph::RemoveNode ( DBGraphVertex * entry )

Definition at line 36 of file db_graph.cc.

Here is the call graph for this function:

◆ Unlink()

void DBGraph::Unlink ( DBGraphEdge * link )

Definition at line 52 of file db_graph.cc.

Here is the call graph for this function:

◆ vertex_count()

size_t DBGraph::vertex_count ( ) const

Definition at line 305 of file db_graph.cc.

◆ vertex_data()

DBGraphVertex* DBGraph::vertex_data ( DBGraphBase::vertex_descriptor vertex ) const

inline

Definition at line 93 of file db_graph.h.

◆ vertex_list_begin()

DBGraph::vertex_iterator DBGraph::vertex_list_begin ( )

Definition at line 293 of file db_graph.cc.

◆ vertex_list_end()

DBGraph::vertex_iterator DBGraph::vertex_list_end ( )

Definition at line 297 of file db_graph.cc.

◆ vertex_target()

DBGraphVertex * DBGraph::vertex_target	(	DBGraphVertex *	current_vertex,
		DBGraphEdge *	edge
	)

private

Definition at line 154 of file db_graph.cc.

Here is the call graph for this function:

◆ Visit() [1/3]

void DBGraph::Visit	(	DBGraphVertex *	start,
		VertexVisitor	vertex_visit_fn,
		EdgeVisitor	edge_visit_fn
	)

Definition at line 111 of file db_graph.cc.

Here is the call graph for this function:

◆ Visit() [2/3]

void DBGraph::Visit	(	DBGraphVertex *	start,
		VertexVisitor	vertex_visit_fn,
		EdgeVisitor	edge_visit_fn,
		const VisitorFilter &	filter
	)

Definition at line 187 of file db_graph.cc.

Here is the call graph for this function:

◆ Visit() [3/3]

void DBGraph::Visit	(	DBGraphVertex *	start,
		VertexVisitor	vertex_visit_fn,
		EdgeVisitor	edge_visit_fn,
		VertexFinish	vertex_finish_fn
	)

Definition at line 102 of file db_graph.cc.

Here is the call graph for this function:

Member Data Documentation

◆ graph_

graph_t DBGraph::graph_

private

Definition at line 138 of file db_graph.h.

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

Classes

Public Types

Public Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ DBEdgeInfo

◆ Edge

◆ EdgeVisitor

◆ Vertex

◆ VertexFinish

◆ VertexVisitor

◆ VisitQ

Member Function Documentation

◆ AddNode()

◆ clear()

◆ edge_count()

◆ edge_data()

◆ edge_list_begin()

◆ edge_list_end()

◆ edge_name()

◆ graph()

◆ IterateEdges()

◆ Link()

◆ RemoveNode()

◆ Unlink()

◆ vertex_count()

◆ vertex_data()

◆ vertex_list_begin()

◆ vertex_list_end()

◆ vertex_target()

◆ Visit() [1/3]

◆ Visit() [2/3]

◆ Visit() [3/3]

Member Data Documentation

◆ graph_