This is a implementation of a UndirectedGraph Graph. By definition a undirected graph has no direction information about his edges. More...

#include <UndirectedGraph.h>

Inheritance diagram for te::graph::UndirectedGraph:

Public Member Functions
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...

te::graph::AbstractIterator *	getIterator ()
	Used to get a iterator associated to graph. More...

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

void	setIterator (te::graph::AbstractIterator *i)
	Used to associate a iterator to graph. More...

	UndirectedGraph ()
	constructor. More...

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

	~UndirectedGraph ()
	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...

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 * >	getEdges (int vId)
	It returns all edges that belongs to 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...

Vertex Access Methods
Method used to access vertex elements from a graph.
virtual te::graph::Vertex *	getFirstVertex ()
	It returns a pointer to the first vertex element of a graph. More...

virtual te::graph::Vertex *	getNextVertex ()
	It returns a pointer to the next vertex element of a graph. More...

virtual te::graph::Vertex *	getPreviousVertex ()
	It returns a pointer to the previous vertex element of a graph. More...

Edge Access Methods
Method used to access edge elements from a graph.
te::graph::Edge *	getFirstEdge ()
	It returns a pointer to the first edge element of a graph. More...

te::graph::Edge *	getNextEdge ()
	It returns a pointer to the next edge element of a graph. More...

te::graph::Edge *	getPreviousEdge ()
	It returns a pointer to the previous edge element of a graph. More...

Protected Attributes
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...

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

te::graph::AbstractIterator *	m_iterator
	Iterator attribute. More...

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

Detailed Description

This is a implementation of a UndirectedGraph Graph. By definition a undirected graph has no direction information about his edges.

See Also: Graph, GraphData, GraphCache

Definition at line 56 of file UndirectedGraph.h.

Constructor & Destructor Documentation

te::graph::UndirectedGraph::UndirectedGraph ( )

constructor.

Definition at line 39 of file UndirectedGraph.cpp.

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

Constructor.

Parameters

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

Definition at line 43 of file UndirectedGraph.cpp.

te::graph::UndirectedGraph::~UndirectedGraph ( )

Virtual destructor.

Definition at line 48 of file UndirectedGraph.cpp.

Member Function Documentation

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.

Definition at line 86 of file Graph.cpp.

References te::graph::Vertex::getId(), te::graph::Vertex::isDirty(), and te::graph::Vertex::isNew().

Referenced by te::graph::DirectedGraph::add(), add(), and te::graph::BidirectionalGraph::add().

void te::graph::UndirectedGraph::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.

Definition at line 111 of file UndirectedGraph.cpp.

References te::graph::Graph::add(), te::graph::Edge::getId(), te::graph::Edge::getIdFrom(), te::graph::Edge::getIdTo(), and te::graph::Vertex::getNeighborhood().

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.

Definition at line 288 of file Graph.cpp.

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.

Definition at line 169 of file Graph.cpp.

Referenced by te::graph::AddDeepAttribute::AddDeepAttribute().

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.

Definition at line 329 of file Graph.cpp.

Referenced by te::graph::AddDeepAttribute::AddDeepAttribute().

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.

Definition at line 261 of file Graph.cpp.

Referenced by te::graph::AddDeepAttribute::calculateDeepValue(), te::graph::GetSubGraph::getPredecessor(), and te::graph::GetSubGraph::GetSubGraph().

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.

Definition at line 304 of file Graph.cpp.

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.

Definition at line 314 of file Graph.cpp.

std::vector< te::graph::Edge * > te::graph::UndirectedGraph::getEdges ( int vId )

virtual

It returns all edges that belongs to a vertex.

Parameters

vId	The attribute used to identify the vertex element

Returns: A vector with edge elements.

Definition at line 195 of file UndirectedGraph.cpp.

References te::graph::Vertex::getNeighborhood().

te::graph::Edge * te::graph::AbstractGraph::getFirstEdge ( )

inherited

It returns a pointer to the first edge element of a graph.

Note: This function is not implemented here, it's just a call to a iterator function.

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

Definition at line 73 of file AbstractGraph.cpp.

References TR_GRAPH.

Referenced by te::graph::QueryGraphBuilder::build(), and te::graph::LayerRenderer::draw().

te::graph::Vertex * te::graph::AbstractGraph::getFirstVertex ( )

virtualinherited

It returns a pointer to the first vertex element of a graph.

Note: This function is not implemented here, it's just a call to a iterator function.

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

Definition at line 43 of file AbstractGraph.cpp.

References TR_GRAPH.

Referenced by te::graph::AddDeepAttribute::AddDeepAttribute(), te::graph::AddRasterAttribute::AddRasterAttribute(), and te::graph::QueryGraphBuilder::build().

te::graph::AbstractIterator * te::graph::AbstractGraph::getIterator ( )

inherited

Used to get a iterator associated to graph.

Returns: Valid pointer to a iterator if exist and null pointer in other case

Definition at line 108 of file AbstractGraph.cpp.

Referenced by te::graph::AddDeepAttribute::AddDeepAttribute(), te::graph::AddRasterAttribute::AddRasterAttribute(), te::graph::QueryGraphBuilder::build(), and te::graph::LayerRenderer::draw().

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.

Definition at line 324 of file Graph.cpp.

te::graph::Edge * te::graph::AbstractGraph::getNextEdge ( )

inherited

It returns a pointer to the next edge element of a graph.

Note: This function is not implemented here, it's just a call to a iterator function.

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

Definition at line 83 of file AbstractGraph.cpp.

References TR_GRAPH.

Referenced by te::graph::QueryGraphBuilder::build(), and te::graph::LayerRenderer::draw().

te::graph::Vertex * te::graph::AbstractGraph::getNextVertex ( )

virtualinherited

It returns a pointer to the next vertex element of a graph.

Note: This function is not implemented here, it's just a call to a iterator function.

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

Definition at line 53 of file AbstractGraph.cpp.

References TR_GRAPH.

Referenced by te::graph::AddDeepAttribute::AddDeepAttribute(), te::graph::AddRasterAttribute::AddRasterAttribute(), and te::graph::QueryGraphBuilder::build().

te::graph::Edge * te::graph::AbstractGraph::getPreviousEdge ( )

inherited

It returns a pointer to the previous edge element of a graph.

Note: This function is not implemented here, it's just a call to a iterator function.

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

Definition at line 93 of file AbstractGraph.cpp.

References TR_GRAPH.

te::graph::Vertex * te::graph::AbstractGraph::getPreviousVertex ( )

virtualinherited

It returns a pointer to the previous vertex element of a graph.

Note: This function is not implemented here, it's just a call to a iterator function.

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

Definition at line 63 of file AbstractGraph.cpp.

References TR_GRAPH.

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.

Definition at line 142 of file Graph.cpp.

Referenced by te::graph::AddDeepAttribute::calculateDeepValue(), te::graph::GetSubGraph::getPredecessor(), and te::graph::GetSubGraph::GetSubGraph().

std::vector< te::graph::Vertex * > te::graph::UndirectedGraph::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.

Definition at line 52 of file UndirectedGraph.cpp.

References te::graph::Edge::getIdFrom(), te::graph::Edge::getIdTo(), and te::graph::Vertex::getNeighborhood().

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.

Definition at line 185 of file Graph.cpp.

Referenced by te::graph::AddDeepAttribute::AddDeepAttribute().

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.

Definition at line 195 of file Graph.cpp.

Referenced by te::graph::AddDeepAttribute::AddDeepAttribute().

bool te::graph::UndirectedGraph::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

Definition at line 91 of file UndirectedGraph.cpp.

References te::graph::Vertex::getNeighborhood().

void te::graph::UndirectedGraph::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.

Definition at line 145 of file UndirectedGraph.cpp.

References te::graph::Edge::getIdFrom(), te::graph::Edge::getIdTo(), te::graph::Vertex::getNeighborhood(), and te::graph::Graph::removeEdge().

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.

Definition at line 296 of file Graph.cpp.

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.

Definition at line 113 of file Graph.cpp.

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.

Definition at line 177 of file Graph.cpp.

void te::graph::AbstractGraph::setIterator ( te::graph::AbstractIterator * i )

inherited

Used to associate a iterator to graph.

Parameters

i	Valid pointer to a iterator

Definition at line 103 of file AbstractGraph.cpp.

Referenced by te::graph::AddDeepAttribute::AddDeepAttribute(), te::graph::AddRasterAttribute::AddRasterAttribute(), te::graph::QueryGraphBuilder::build(), and te::graph::LayerRenderer::draw().

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.

Definition at line 106 of file Graph.cpp.

References te::graph::Vertex::setDirty().

Referenced by te::graph::AddDeepAttribute::AddDeepAttribute().

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.

Definition at line 225 of file Graph.cpp.

References te::graph::Edge::setDirty().

Member Data Documentation

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

protectedinherited

Used to load and save GraphData information from a DataSource.

Definition at line 284 of file Graph.h.

Referenced by te::graph::Graph::Graph().

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

protectedinherited

Class used to keep all graph data loaded.

Definition at line 286 of file Graph.h.

Referenced by te::graph::Graph::Graph().

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

protectedinherited

This class has the graph data and properties.

Definition at line 282 of file Graph.h.

te::graph::AbstractIterator* te::graph::AbstractGraph::m_iterator

protectedinherited

Iterator attribute.

Definition at line 322 of file AbstractGraph.h.

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

protectedinherited

Graph Data loader strategy.

Definition at line 288 of file Graph.h.

Referenced by te::graph::Graph::Graph().

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

/home/castejon/castejon_files/develop/terralib5/git/src/terralib/graph/graphs/UndirectedGraph.h
/home/castejon/castejon_files/develop/terralib5/git/src/terralib/graph/graphs/UndirectedGraph.cpp

Public Member Functions

Protected Attributes

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation