VertexClique - clique of graph vertices.
More...
#include <si/graph/vertexclique.h>
|
| std::set< Vertex * > | _vertices |
| |
| virtual unsigned | connectivity (const std::string &label, std::set< CComponent * > *sc=0, const std::string &SyntType="") const |
| | Calcule les composantes connexes pour une étiquette.
|
| |
| static unsigned | connectivity (const std::set< Vertex * > &vx, std::set< CComponent * > *sc=0, const std::string &syntType="") |
| | Calcule les composantes connexes pour un ensemble de noeuds.
|
| |
| static unsigned | connectivity (const std::set< Vertex * > &vx, std::set< CComponent * > *sc, const std::set< std::string > &syntTypes) |
| | Calcule les composantes connexes pour un ensemble de noeuds et de syntaxes de relations.
|
| |
| static void | connPropagate (Vertex *v, const std::set< Vertex * > &vx, std::set< Vertex * > &done, CComponent *cc, const std::set< std::string > &syntTypes) |
| | Propagation d'une composante connexe.
|
| |
| iterator | begin () |
| | Les itérateurs non-constants sont en accès protégé.
|
| |
| iterator | end () |
| | Les itérateurs non-constants sont en accès protégé.
|
| |
VertexClique - clique of graph vertices.
Definition at line 19 of file vertexclique.h.
◆ const_iterator
◆ iterator
◆ VertexClique() [1/3]
| sigraph::VertexClique::VertexClique |
( |
| ) |
|
|
inline |
◆ VertexClique() [2/3]
| sigraph::VertexClique::VertexClique |
( |
const std::set< Vertex * > & | vert | ) |
|
◆ VertexClique() [3/3]
| sigraph::VertexClique::VertexClique |
( |
const VertexClique & | cl | ) |
|
Ne copie que les attributs, pas les noeuds contenus !
References VertexClique().
◆ ~VertexClique()
| sigraph::VertexClique::~VertexClique |
( |
| ) |
|
◆ addVertex()
| void sigraph::VertexClique::addVertex |
( |
Vertex * | vert | ) |
|
◆ begin() [1/2]
◆ begin() [2/2]
◆ clear()
| virtual void sigraph::VertexClique::clear |
( |
| ) |
|
|
virtual |
◆ connectivity() [1/3]
| static unsigned sigraph::VertexClique::connectivity |
( |
const std::set< Vertex * > & | vx, |
|
|
std::set< CComponent * > * | sc, |
|
|
const std::set< std::string > & | syntTypes ) |
|
static |
Calcule les composantes connexes pour un ensemble de noeuds et de syntaxes de relations.
◆ connectivity() [2/3]
| static unsigned sigraph::VertexClique::connectivity |
( |
const std::set< Vertex * > & | vx, |
|
|
std::set< CComponent * > * | sc = 0, |
|
|
const std::string & | syntType = "" ) |
|
static |
Calcule les composantes connexes pour un ensemble de noeuds.
◆ connectivity() [3/3]
| virtual unsigned sigraph::VertexClique::connectivity |
( |
const std::string & | label, |
|
|
std::set< CComponent * > * | sc = 0, |
|
|
const std::string & | SyntType = "" ) const |
|
virtual |
Calcule les composantes connexes pour une étiquette.
- Parameters
-
| label | étiquette pour laquelle on cherche les composantes |
| sc | si non NULL, la fonction remplit la liste des composantes, il faut les effacer... |
| syntType | Type syntaxique de relation concerné. Si ce paramètre n'est pas donné, on connecte par cherche n'importe quel type de relation. |
- Returns
- nombre de composantes connexes
◆ connPropagate()
| static void sigraph::VertexClique::connPropagate |
( |
Vertex * | v, |
|
|
const std::set< Vertex * > & | vx, |
|
|
std::set< Vertex * > & | done, |
|
|
CComponent * | cc, |
|
|
const std::set< std::string > & | syntTypes ) |
|
static |
Propagation d'une composante connexe.
- Parameters
-
| v | noeud d'origine de la composante (graine) |
| vx | ensemble des noeuds possibles |
| done | ceux qui ont déjà été traités |
| cc | composante connexe à remplir (si non NULL) |
◆ deepCopy()
| virtual Clique * sigraph::VertexClique::deepCopy |
( |
| ) |
const |
|
virtual |
copies the clique and the elements it refers too
For a VertexClique operating on graph vertices, the vertices are copied (althrough they are in the general case only pointers to the nodes inside the original graph).
This behaviour is needed for cliques modifications that will also affect the elements referred, such as noising data during learning. Copied cliques are requested to set their internal attribute "is_copy" (of type bool) to true, so we know when we have a copied clique which may have allocated data (and must free it upon destruction)
Inherited classes <it>MUST</it> define this important function
- Returns
- copied clique
Implements sigraph::Clique.
References sigraph::Clique::Clique().
◆ edgesBetween()
| virtual void sigraph::VertexClique::edgesBetween |
( |
const std::set< Vertex * > & | s1, |
|
|
const std::set< Vertex * > & | s2, |
|
|
std::set< Edge * > & | ed ) const |
|
virtual |
Trouve les relations entre deux sous-ensembles.
◆ edgesBetweenLabels()
| virtual void sigraph::VertexClique::edgesBetweenLabels |
( |
const std::string & | label1, |
|
|
const std::string & | label2, |
|
|
std::set< Edge * > & | ed ) const |
|
virtual |
Trouve les relations qui relient les noeuds de label {\tt label1} aux noeuds de label {\tt label2}.
- Parameters
-
| label1 | 1er label |
| label2 | 2e label |
| edges | (retour) les relations trouvées y sont stockées |
◆ end() [1/2]
◆ end() [2/2]
◆ getVerticesWith() [1/2]
| std::set< Vertex * > sigraph::VertexClique::getVerticesWith |
( |
const std::string & | s | ) |
const |
Find the vertices which contain a given semantic attribute.
◆ getVerticesWith() [2/2]
template<class T>
| std::set< Vertex * > sigraph::VertexClique::getVerticesWith |
( |
const std::string & | s, |
|
|
const T & | t ) const |
|
inline |
◆ removeVertex()
| void sigraph::VertexClique::removeVertex |
( |
Vertex * | vert | ) |
|
◆ size()
| size_t sigraph::VertexClique::size |
( |
| ) |
const |
|
inline |
◆ vertices()
| const std::set< Vertex * > & sigraph::VertexClique::vertices |
( |
| ) |
const |
|
inline |
◆ _vertices
| std::set<Vertex*> sigraph::VertexClique::_vertices |
|
protected |
The documentation for this class was generated from the following file: