Rule right side graph.
More...
#include <RuleGraph.hh>
Implements the sgm::Graph_Interface class to allow for the search of
the right side of a given Rule object using the sgm library.
- Author
- Martin Mann (c) 2008 http://www.bioinf.uni-freiburg.de/~mmann/
Definition at line 271 of file RuleGraph.hh.
| ggl::RightSidePattern::RightSidePattern |
( |
const Rule & |
rule | ) |
|
| virtual ggl::RightSidePattern::~RightSidePattern |
( |
| ) |
|
|
virtual |
Computes the connected components of a given graph. It stores the connected component ID of each node within the provided container and returns the number of components.
- Parameters
-
| g | the graph to check for connected components |
| compID | the container to store the component ID information within |
- Returns
- the number of connected components within g
Access to the label of a specified edge
- Parameters
-
| i | the index of the first end node of interest |
| j | the index of the second end node of interest |
- Returns
- the edge iterator pointing to the first edge between node i and j or to getEdgesEnd(i,j) if no edge exists
Access to the label of a specified edge
- Parameters
-
| i | the index of the first end node of interest |
| j | the index of the second end node of interest |
- Returns
- the edge iterator pointing to the first edge between node i and j or to getEdgesEnd(i,j) if no edge exists
| virtual std::string ggl::RightSidePattern::getNodeLabel |
( |
const IndexType & |
i | ) |
const |
|
virtual |
Access to the label of a specified node
- Parameters
-
| i | the index of the node of interest |
- Returns
- a string representation of the node label
Implements sgm::Graph_Interface.
| virtual size_t ggl::RightSidePattern::getNodeNumber |
( |
void |
| ) |
const |
|
virtual |
Access to the number of nodes of the graph
- Returns
- the overall node number
Implements sgm::Graph_Interface.
Access to iteration begin for the edge in the adjacency list of a specified node
- Parameters
-
| i | the index of the node of interest |
- Returns
- the iterator to the first edge within the adjacency of i
Implements sgm::Graph_Interface.
Access to iteration end for the edge in the adjacency list of a specified node
- Parameters
-
| i | the index of the node of interest |
- Returns
- the iterator the end of the adjacency iteration of i
Implements sgm::Graph_Interface.
| virtual const Rule& ggl::RightSidePattern::getRule |
( |
void |
| ) |
const |
|
virtual |
Constant access to the internal Rule object.
- Returns
- the internal Rule object
| static void sgm::Graph_Interface::labelAdjacentNodes |
( |
const Graph_Interface & |
g, |
|
|
const size_t |
curNode, |
|
|
CompLabel & |
compID, |
|
|
const size_t |
label |
|
) |
| |
|
staticprotectedinherited |
Performs a depths-first-search labeling of all accessible nodes starting from curNode within g. The reached nodes are labeled with the given label in the component ID container compID
- Parameters
-
| the | graph to screen |
| curNode | the node to start the search from |
| compID | the container to store the component ID information within |
| label | the component ID to be used for all nodes of the connected component reachable from curNode |
| virtual bool sgm::Graph_Interface::operator!= |
( |
const Graph_Interface & |
toCompare | ) |
const |
|
virtualinherited |
Interface inequality comparison : NOTE : this function checks whether the interfaces of two graphs are identical or not, i.e. nodes with same index are equal and the order of adjacent edges is the same. This function performs NO GRAPH ISOMORPHISM !!! Thus, slight changes in the node order etc. will result in a non-equal interface!
- Parameters
-
- Returns
- true if both graph interfaces are different
| virtual bool sgm::Graph_Interface::operator== |
( |
const Graph_Interface & |
toCompare | ) |
const |
|
virtualinherited |
Interface equality comparison : NOTE : this function checks whether the interfaces of two graphs are identical or not, i.e. nodes with same index are equal and the order of adjacent edges is the same. This function performs NO GRAPH ISOMORPHISM !!! Thus, slight changes in the node order etc. will result in a non-equal interface!
- Parameters
-
- Returns
- true if both graph interfaces are equal
| const Rule& ggl::RightSidePattern::rule |
|
protected |
The documentation for this class was generated from the following file:
