This is a implementation of a Bidirectional Graph. By convention a bidirectional graph provides access to out-and in edges. More...

#include <BidirectionalGraph.h>

Inheritance diagram for te::graph::BidirectionalGraph:

Public Member Functions
	BidirectionalGraph ()
	constructor. More...

	BidirectionalGraph (AbstractCachePolicy cp, AbstractGraphLoaderStrategy ls)
	Constructor. More...

	BidirectionalGraph (GraphMetadata *metadata)
	Constructor. More...

	~BidirectionalGraph ()
	Virtual destructor. More...

Vertex Access Methods
Method used to access vertex elements from a graph.
virtual std::vector< te::graph::Vertex * >	getVertexNeighborhood (int id)
	The neighborhood of a vertex v is an induced subgraph of the graph, formed by all vertices adjacent to v. More...

virtual bool	isIsolateVertex (int id, bool &flag)
	This function indicates if a desired element is a isolated vertex. More...

virtual bool	isSourceVertex (int id, bool &flag)
	This function indicates if a desired element is a source vertex. More...

virtual bool	isSinkVertex (int id, bool &flag)
	This function indicates if a desired element is a sink vertex. More...

Edge Access Methods
Method used to access edge elements from a graph.
virtual void	add (Edge *e)
	Add a new edge element to a graph. More...

virtual void	removeEdge (int id)
	This function removes the edge element from graph, also was removed in data source. More...

virtual std::vector< te::graph::Edge * >	getInEdges (int vId)
	It returns all edges that came in a vertex. More...

virtual std::vector< te::graph::Edge * >	getOutEdges (int vId)
	It returns all edges that came out a vertex. More...

Vertex Access Methods
Method used to access vertex elements from a graph.
virtual void	add (Vertex *v)
	Add a new vertex element to a graph. More...

virtual void	update (Vertex *v)
	Update the vertex element. More...

virtual void	removeVertex (int id)
	This function removes the vertex element from graph, also was removed in data source. More...

virtual te::graph::Vertex *	getVertex (int id)
	It returns the vertex element if it's exist. More...

virtual void	addVertexProperty (te::dt::Property *p)
	Add a new property associated to the vertex element. More...

virtual void	removeVertexProperty (int idx)
	Remove a property associated to the vertex element. More...

virtual te::dt::Property *	getVertexProperty (int idx)
	Get a vertex property given a index. More...

virtual int	getVertexPropertySize ()
	Used to verify the number of properties associated to vertex elements. More...

Edge Access Methods
Method used to access edge elements from a graph.
virtual void	update (Edge *e)
	Update the edge element. More...

virtual te::graph::Edge *	getEdge (int id)
	It returns the edge element if it's exist. More...

virtual void	addEdgeProperty (te::dt::Property *p)
	Add a new property associated to the edge element. More...

virtual void	removeEdgeProperty (int idx)
	Remove a property associated to the edge element. More...

virtual te::dt::Property *	getEdgeProperty (int idx)
	Get a edge property given a index. More...

virtual int	getEdgePropertySize ()
	Used to verify the number of properties associated to edge elements. More...

virtual te::graph::GraphMetadata *	getMetadata ()
	Function used to access the graph metadata. More...

virtual void	flush ()
	Function used to clear the memory cache, all elements was released from memory, if any element was changes it will be saved. More...

GraphDataManager *	m_dataManager
	Used to load and save GraphData information from a DataSource. More...

GraphCache *	m_graphCache
	Class used to keep all graph data loaded. More...

GraphMetadata *	m_metadata
	Graph Data loader strategy. More...

GraphData *	m_graphData
	This class has the graph data and properties. More...

Detailed Description

This is a implementation of a Bidirectional Graph. By convention a bidirectional graph provides access to out-and in edges.

See also: AbstractGraph, GraphData, GraphCache

Definition at line 56 of file BidirectionalGraph.h.

Constructor & Destructor Documentation

◆ BidirectionalGraph() [1/3]

te::graph::BidirectionalGraph::BidirectionalGraph ( )

constructor.

◆ BidirectionalGraph() [2/3]

te::graph::BidirectionalGraph::BidirectionalGraph ( GraphMetadata * metadata )

Constructor.

Parameters

metadata A pointer to a graph metadata implementation

◆ BidirectionalGraph() [3/3]

te::graph::BidirectionalGraph::BidirectionalGraph	(	AbstractCachePolicy *	cp,
		AbstractGraphLoaderStrategy *	ls
	)

Constructor.

Parameters

cp	A pointer to a cache policy implementation
ls	A pointer to a loader strategy implementation

◆ ~BidirectionalGraph()

te::graph::BidirectionalGraph::~BidirectionalGraph ( )

Virtual destructor.

Member Function Documentation

◆ add() [1/2]

virtual void te::graph::BidirectionalGraph::add ( Edge * e )

virtual

Add a new edge element to a graph.

Parameters

e	Edge element

Note: This function turns the dirty flag of current GraphData to true, the new flag of the edge turns to true.

Reimplemented from te::graph::Graph.

◆ add() [2/2]

virtual void te::graph::Graph::add ( Vertex * v )

virtualinherited

Add a new vertex element to a graph.

Parameters

v	Vertex element

Note: This function turns the dirty flag of current GraphData to true, the new flag of the vertex turns to true.

Implements te::graph::AbstractGraph.

◆ addEdgeProperty()

virtual void te::graph::Graph::addEdgeProperty ( te::dt::Property * p )

virtualinherited

Add a new property associated to the edge element.

param p New property to be associated with edge elements.

Note: It's important before using this function call the flush() function, its necessary to force the memory clear and the elements will be loaded with the right size of properties.

Implements te::graph::AbstractGraph.

◆ addVertexProperty()

virtual void te::graph::Graph::addVertexProperty ( te::dt::Property * p )

virtualinherited

Add a new property associated to the vertex element.

param p New property to be associated with vertex elements.

Note: It's important before using this function call the flush() function, its necessary to force the memory clear and the elements will be loaded with the right size of properties.

Implements te::graph::AbstractGraph.

◆ flush()

virtual void te::graph::Graph::flush ( )

virtualinherited

Function used to clear the memory cache, all elements was released from memory, if any element was changes it will be saved.

Returns

Implements te::graph::AbstractGraph.

◆ getEdge()

virtual te::graph::Edge* te::graph::Graph::getEdge ( int id )

virtualinherited

It returns the edge element if it's exist.

Parameters

id	Vertex identification

Returns: A valid vertex point if the element was found and a null pointer in other case.

Implements te::graph::AbstractGraph.

◆ getEdgeProperty()

virtual te::dt::Property* te::graph::Graph::getEdgeProperty ( int idx )

virtualinherited

Get a edge property given a index.

Parameters

idx	Index of the property

Returns: A property associated to the edge element if the index is right and a null pointer in other case.

Implements te::graph::AbstractGraph.

◆ getEdgePropertySize()

virtual int te::graph::Graph::getEdgePropertySize ( )

virtualinherited

Used to verify the number of properties associated to edge elements.

Returns: Integer value with the number of properties.

Implements te::graph::AbstractGraph.

◆ getInEdges()

virtual std::vector<te::graph::Edge*> te::graph::BidirectionalGraph::getInEdges ( int vId )

virtual

It returns all edges that came in a vertex.

Parameters

vId	The attribute used to identify the vertex element

Returns: A vector with edge elements.

◆ getMetadata()

virtual te::graph::GraphMetadata* te::graph::Graph::getMetadata ( )

virtualinherited

Function used to access the graph metadata.

Returns: A pointer to a class that defines the graph metadata

Implements te::graph::AbstractGraph.

◆ getOutEdges()

virtual std::vector<te::graph::Edge*> te::graph::BidirectionalGraph::getOutEdges ( int vId )

virtual

It returns all edges that came out a vertex.

Parameters

vId	The attribute used to identify the vertex element

Returns: A vector with edge elements.

◆ getVertex()

virtual te::graph::Vertex* te::graph::Graph::getVertex ( int id )

virtualinherited

It returns the vertex element if it's exist.

Parameters

id	Vertex identification

Returns: A valid vertex point if the element was found and a null pointer in other case.

Implements te::graph::AbstractGraph.

◆ getVertexNeighborhood()

virtual std::vector<te::graph::Vertex*> te::graph::BidirectionalGraph::getVertexNeighborhood ( int id )

virtual

The neighborhood of a vertex v is an induced subgraph of the graph, formed by all vertices adjacent to v.

Parameters

id	The attribute used to identify the vertex element

Returns: A vector with vertex elements.

◆ getVertexProperty()

virtual te::dt::Property* te::graph::Graph::getVertexProperty ( int idx )

virtualinherited

Get a vertex property given a index.

Parameters

idx	Index of the property

Returns: A property associated to the vertex element if the index is right and a null pointer in other case.

Implements te::graph::AbstractGraph.

◆ getVertexPropertySize()

virtual int te::graph::Graph::getVertexPropertySize ( )

virtualinherited

Used to verify the number of properties associated to vertex elements.

Returns: Integer value with the number of properties.

Implements te::graph::AbstractGraph.

◆ isIsolateVertex()

virtual bool te::graph::BidirectionalGraph::isIsolateVertex	(	int	id,
		bool &	flag
	)

virtual

This function indicates if a desired element is a isolated vertex.

Parameters

id	The attribute used to identify the vertex element
flag	Flag used to indicating if the element is a isolated vertex.

Returns: True if the vertex element was found and false in other case

◆ isSinkVertex()

virtual bool te::graph::BidirectionalGraph::isSinkVertex	(	int	id,
		bool &	flag
	)

virtual

This function indicates if a desired element is a sink vertex.

Parameters

id	The attribute used to identify the vertex element
flag	Flag used to indicating if the element is a sink vertex.

Returns: True if the vertex element was found and false in other case

◆ isSourceVertex()

virtual bool te::graph::BidirectionalGraph::isSourceVertex	(	int	id,
		bool &	flag
	)

virtual

This function indicates if a desired element is a source vertex.

Parameters

id	The attribute used to identify the vertex element
flag	Flag used to indicating if the element is a source vertex.

Returns: True if the vertex element was found and false in other case

◆ removeEdge()

virtual void te::graph::BidirectionalGraph::removeEdge ( int id )

virtual

This function removes the edge element from graph, also was removed in data source.

Parameters

id	Edge identification

Reimplemented from te::graph::Graph.

◆ removeEdgeProperty()

virtual void te::graph::Graph::removeEdgeProperty ( int idx )

virtualinherited

Remove a property associated to the edge element.

Parameters

idx	Index of the property

Implements te::graph::AbstractGraph.

◆ removeVertex()

virtual void te::graph::Graph::removeVertex ( int id )

virtualinherited

This function removes the vertex element from graph, also was removed in data source.

Parameters

id	Vertex identification

Implements te::graph::AbstractGraph.

◆ removeVertexProperty()

virtual void te::graph::Graph::removeVertexProperty ( int idx )

virtualinherited

Remove a property associated to the vertex element.

Parameters

idx	Index of the property

Implements te::graph::AbstractGraph.

◆ update() [1/2]

virtual void te::graph::Graph::update ( Edge * e )

virtualinherited

Update the edge element.

Parameters

e	Edge element

Note: This function turns the dirty flag of current GraphData to true and also the dirty flag of the edge.

Implements te::graph::AbstractGraph.

◆ update() [2/2]

virtual void te::graph::Graph::update ( Vertex * v )

virtualinherited

Update the vertex element.

Parameters

v	Vertex element

Note: This function turns the dirty flag of current GraphData to true and also the dirty flag of the vertex.

Implements te::graph::AbstractGraph.

Member Data Documentation

◆ m_dataManager

GraphDataManager* te::graph::Graph::m_dataManager

protectedinherited

Used to load and save GraphData information from a DataSource.

Definition at line 290 of file Graph.h.

◆ m_graphCache

GraphCache* te::graph::Graph::m_graphCache

protectedinherited

Class used to keep all graph data loaded.

Definition at line 292 of file Graph.h.

◆ m_graphData

GraphData* te::graph::Graph::m_graphData

inherited

This class has the graph data and properties.

Definition at line 298 of file Graph.h.

◆ m_metadata

GraphMetadata* te::graph::Graph::m_metadata

protectedinherited

Graph Data loader strategy.

Definition at line 294 of file Graph.h.

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

/home/castejon/castejon_files/develop/terralib5/git_release/src/terralib/graph/graphs/BidirectionalGraph.h

Public Member Functions

Edge Access Methods

Detailed Description

Constructor & Destructor Documentation

◆ BidirectionalGraph() [1/3]

◆ BidirectionalGraph() [2/3]

◆ BidirectionalGraph() [3/3]

◆ ~BidirectionalGraph()

Member Function Documentation

◆ add() [1/2]

◆ add() [2/2]

◆ addEdgeProperty()

◆ addVertexProperty()

◆ flush()

◆ getEdge()

◆ getEdgeProperty()

◆ getEdgePropertySize()

◆ getInEdges()

◆ getMetadata()

◆ getOutEdges()

◆ getVertex()

◆ getVertexNeighborhood()

◆ getVertexProperty()

◆ getVertexPropertySize()

◆ isIsolateVertex()

◆ isSinkVertex()

◆ isSourceVertex()

◆ removeEdge()

◆ removeEdgeProperty()

◆ removeVertex()

◆ removeVertexProperty()

◆ update() [1/2]

◆ update() [2/2]

Member Data Documentation

◆ m_dataManager

◆ m_graphCache

◆ m_graphData

◆ m_metadata