This is a implementation of a Bidirectional Graph. By convention a bidirectional graph provides access to out-and in edges. More...
#include <BidirectionalGraph.h>
Public Member Functions | |
BidirectionalGraph () | |
constructor. More... | |
BidirectionalGraph (GraphMetadata *metadata) | |
Constructor. More... | |
BidirectionalGraph (AbstractCachePolicy *cp, AbstractGraphLoaderStrategy *ls) | |
Constructor. 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... | |
virtual te::graph::GraphMetadata * | getMetadata () |
Function used to access the graph metadata. 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... | |
Public Attributes | |
GraphData * | m_graphData |
This class has the graph data and properties. 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... | |
GraphMetadata * | m_metadata |
Graph Data loader strategy. More... | |
This is a implementation of a Bidirectional Graph. By convention a bidirectional graph provides access to out-and in edges.
Definition at line 56 of file BidirectionalGraph.h.
te::graph::BidirectionalGraph::BidirectionalGraph | ( | ) |
constructor.
Definition at line 43 of file BidirectionalGraph.cpp.
te::graph::BidirectionalGraph::BidirectionalGraph | ( | GraphMetadata * | metadata | ) |
Constructor.
metadata | A pointer to a graph metadata implementation |
Definition at line 47 of file BidirectionalGraph.cpp.
te::graph::BidirectionalGraph::BidirectionalGraph | ( | AbstractCachePolicy * | cp, |
AbstractGraphLoaderStrategy * | ls | ||
) |
Constructor.
cp | A pointer to a cache policy implementation |
ls | A pointer to a loader strategy implementation |
Definition at line 52 of file BidirectionalGraph.cpp.
te::graph::BidirectionalGraph::~BidirectionalGraph | ( | ) |
Virtual destructor.
Definition at line 57 of file BidirectionalGraph.cpp.
|
virtualinherited |
Add a new vertex element to a graph.
v | Vertex element |
Implements te::graph::AbstractGraph.
Definition at line 98 of file Graph.cpp.
Referenced by te::graph::DirectedGraph::add(), te::graph::UndirectedGraph::add(), and add().
|
virtual |
Add a new edge element to a graph.
e | Edge element |
Reimplemented from te::graph::Graph.
Definition at line 165 of file BidirectionalGraph.cpp.
References te::graph::Graph::add(), te::graph::Edge::getId(), te::graph::Edge::getIdFrom(), te::graph::Edge::getIdTo(), te::graph::Vertex::getPredecessors(), and te::graph::Vertex::getSuccessors().
|
virtualinherited |
Add a new property associated to the edge element.
param p New property to be associated with edge elements.
Implements te::graph::AbstractGraph.
|
virtualinherited |
Add a new property associated to the vertex element.
param p New property to be associated with vertex elements.
Implements te::graph::AbstractGraph.
Definition at line 158 of file Graph.cpp.
Referenced by te::graph::AddDeepAttribute::AddDeepAttribute().
|
virtualinherited |
Function used to clear the memory cache, all elements was released from memory, if any element was changes it will be saved.
Implements te::graph::AbstractGraph.
Definition at line 295 of file Graph.cpp.
Referenced by te::graph::AddDeepAttribute::AddDeepAttribute().
|
virtualinherited |
It returns the edge element if it's exist.
id | Vertex identification |
Implements te::graph::AbstractGraph.
Definition at line 234 of file Graph.cpp.
Referenced by te::graph::AddDeepAttribute::calculateDeepValue(), te::graph::GetSubGraph::getPredecessor(), and te::graph::GetSubGraph::GetSubGraph().
|
virtualinherited |
Get a edge property given a index.
idx | Index of the property |
Implements te::graph::AbstractGraph.
|
virtualinherited |
Used to verify the number of properties associated to edge elements.
Implements te::graph::AbstractGraph.
|
virtual |
It returns all edges that came in a vertex.
vId | The attribute used to identify the vertex element |
Definition at line 250 of file BidirectionalGraph.cpp.
References te::graph::Vertex::getPredecessors().
|
virtualinherited |
Function used to access the graph metadata.
Implements te::graph::AbstractGraph.
|
virtual |
It returns all edges that came out a vertex.
vId | The attribute used to identify the vertex element |
Definition at line 276 of file BidirectionalGraph.cpp.
References te::graph::Vertex::getSuccessors().
|
virtualinherited |
It returns the vertex element if it's exist.
id | Vertex identification |
Implements te::graph::AbstractGraph.
Definition at line 138 of file Graph.cpp.
Referenced by te::graph::AddDeepAttribute::calculateDeepValue(), te::graph::GetSubGraph::getPredecessor(), and te::graph::GetSubGraph::GetSubGraph().
|
virtual |
The neighborhood of a vertex v is an induced subgraph of the graph, formed by all vertices adjacent to v.
id | The attribute used to identify the vertex element |
Definition at line 61 of file BidirectionalGraph.cpp.
References te::graph::Edge::getIdFrom(), te::graph::Edge::getIdTo(), te::graph::Vertex::getPredecessors(), and te::graph::Vertex::getSuccessors().
|
virtualinherited |
Get a vertex property given a index.
idx | Index of the property |
Implements te::graph::AbstractGraph.
Definition at line 174 of file Graph.cpp.
Referenced by te::graph::AddDeepAttribute::AddDeepAttribute().
|
virtualinherited |
Used to verify the number of properties associated to vertex elements.
Implements te::graph::AbstractGraph.
Definition at line 184 of file Graph.cpp.
Referenced by te::graph::AddDeepAttribute::AddDeepAttribute().
|
virtual |
This function indicates if a desired element is a isolated vertex.
id | The attribute used to identify the vertex element |
flag | Flag used to indicating if the element is a isolated vertex. |
Definition at line 102 of file BidirectionalGraph.cpp.
References te::graph::Vertex::getPredecessors(), and te::graph::Vertex::getSuccessors().
|
virtual |
This function indicates if a desired element is a sink vertex.
id | The attribute used to identify the vertex element |
flag | Flag used to indicating if the element is a sink vertex. |
Definition at line 144 of file BidirectionalGraph.cpp.
References te::graph::Vertex::getSuccessors().
|
virtual |
This function indicates if a desired element is a source vertex.
id | The attribute used to identify the vertex element |
flag | Flag used to indicating if the element is a source vertex. |
Definition at line 123 of file BidirectionalGraph.cpp.
References te::graph::Vertex::getPredecessors().
|
virtual |
This function removes the edge element from graph, also was removed in data source.
id | Edge identification |
Reimplemented from te::graph::Graph.
Definition at line 198 of file BidirectionalGraph.cpp.
References te::graph::Edge::getIdFrom(), te::graph::Edge::getIdTo(), te::graph::Vertex::getPredecessors(), te::graph::Vertex::getSuccessors(), and te::graph::Graph::removeEdge().
|
virtualinherited |
Remove a property associated to the edge element.
idx | Index of the property |
Implements te::graph::AbstractGraph.
|
virtualinherited |
This function removes the vertex element from graph, also was removed in data source.
id | Vertex identification |
Implements te::graph::AbstractGraph.
|
virtualinherited |
Remove a property associated to the vertex element.
idx | Index of the property |
Implements te::graph::AbstractGraph.
|
virtualinherited |
Update the vertex element.
v | Vertex element |
Implements te::graph::AbstractGraph.
Definition at line 113 of file Graph.cpp.
References te::graph::Vertex::setDirty().
Referenced by te::graph::AddDeepAttribute::AddDeepAttribute().
|
virtualinherited |
Update the edge element.
e | Edge element |
Implements te::graph::AbstractGraph.
Definition at line 209 of file Graph.cpp.
References te::graph::Edge::setDirty().
|
protectedinherited |
Used to load and save GraphData information from a DataSource.
Definition at line 290 of file Graph.h.
Referenced by te::graph::Graph::Graph().
|
protectedinherited |
Class used to keep all graph data loaded.
Definition at line 292 of file Graph.h.
Referenced by te::graph::Graph::Graph().
|
inherited |
This class has the graph data and properties.
Definition at line 298 of file Graph.h.
Referenced by te::graph::Graph::Graph(), and te::graph::MemoryIterator::MemoryIterator().
|
protectedinherited |
Graph Data loader strategy.
Definition at line 294 of file Graph.h.
Referenced by te::graph::Graph::Graph().