Folds Random graph. More...

#include <si/fold/frgraph.h>

Inheritance diagram for sigraph::FRGraph:

[legend]

Collaboration diagram for sigraph::FRGraph:

[legend]

Public Member Functions
Constructeur(s) - destructeur
	FRGraph (const std::string synt="", const std::string clqDescr="standard1")
	Constructeur.

virtual	~FRGraph ()

Fonctions propres
virtual ModelFinder &	modelFinder ()
	Renvoie un descripteur de clique adapté au modèle.

virtual void	addEdges (const Graph &gr, const Model *mod)
	Ajoute des "random edges" en liant des labels qui sont effectivement liés dans le graphe exemple.

virtual Edge *	makeEdge (Vertex v1, Vertex v2, const std::string &label1, const std::string &label2, const Model *mod)
	Crée un "random edge".

virtual void	createTriangDomainFiles (const std::string &dir)
	Crée des fichiers .tri avec les boîtes des domaines.

virtual void	createFakeRel ()
	Crée la relation FoldFakeRel.

Public Member Functions inherited from sigraph::MGraph
virtual	~MGraph ()

virtual void	clearAll ()

virtual std::string	domainFile (const std::string &graphname, const carto::AttributedObject *ao)

virtual std::string	modelFile (const std::string &graphname, const carto::AttributedObject *ao, std::set< std::string > &otherFiles)

virtual void	closeLearning ()
	Ferme l'apprentissage de tous les modèles.

virtual void	initStats ()
	Initialise les stats.

virtual void	initAdap ()
	Initialise les partie adaptatives (réseaux de neurones et autres)

virtual void	initDomain ()
	Initialise les domaines d'influence.

virtual void	removeUnusedModels (bool removeFiles=false, const std::string &prefix="")
	Elimine les noeuds et relations non-utilisés (de domaine vide)

virtual unsigned	removeRareEdges (float freqmin)
	Enlève les relations peu fréquentes (max.

virtual void	removeEdgesToVoid ()
	Enlève les relations avec le label 'brain'.

virtual void	setWeights (double factor=1.)
	Fixe les poids des modèles des noeuds.

virtual void	removeWeights ()
	Enlève les poids des modèles des noeuds.

virtual VersionCheck	checkCompatibility (const Graph &data) const
	Checks compatibility between this model graph and the given data graph.

Public Member Functions inherited from Graph
	Graph (const std::string &s="")

	Graph (const FactoryPtr factory, const std::string &s="")

virtual	~Graph ()

void	extract (Graph &graph, InputIterator iv1, InputIterator iv2)

void	clear ()

Vertex *	addVertex (const std::string &s="")

Vertex *	cloneVertex (const Vertex *vertex)

bool	hasVertex (const Vertex *vertex) const

void	removeVertex (Vertex *vertex)

Vertex *	randomVertex () const

const std::set< Vertex * > &	vertices () const

std::set< Vertex * >	getVerticesWith (const std::string &s) const

std::set< Vertex * >	getVerticesWith (const std::string &s, const T &t) const

Edge *	addUndirectedEdge (Vertex vertex1, Vertex vertex2, std::string s)

Edge *	addEdge (Vertex vertex1, Vertex vertex2, std::string s="")

Edge *	addDirectedEdge (Vertex vertex1, Vertex vertex2, std::string s)

bool	hasEdge (const Edge *edge) const

void	removeEdge (Edge *edge)

const std::set< Edge * > &	edges () const

std::set< Edge * >	edges (const Vertex vertex1, const Vertex vertex2) const

std::set< Edge * >	getEdgesWith (const std::string &s) const

std::set< Edge * >	getEdgesWith (const std::string &s, const T &t) const

iterator	begin ()

iterator	end ()

const_iterator	begin () const

const_iterator	end () const

reverse_iterator	rbegin ()

reverse_iterator	rend ()

const_reverse_iterator	rbegin () const

const_reverse_iterator	rend () const

size_t	order () const

size_t	size () const __attribute__((__deprecated__("use edgeSize() for " "the number of edges. In a future release

size_t	size () will return the " "number properties as it does in GenericObject")))

size_t	edgesSize () const

virtual bool	isUndirected () const

virtual bool	isDirected () const

virtual bool	check (const carto::SyntaxSet &syntax, std::set< std::string > &missing) const

void	clear ()

Vertex *	addVertex (const std::string &s="")

Vertex *	cloneVertex (const Vertex *vertex)

bool	hasVertex (const Vertex *vertex) const

void	removeVertex (Vertex *vertex)

Vertex *	randomVertex () const

const std::set< Vertex * > &	vertices () const

std::set< Vertex * >	getVerticesWith (const std::string &s) const

std::set< Vertex * >	getVerticesWith (const std::string &s, const T &t) const

Edge *	addUndirectedEdge (Vertex vertex1, Vertex vertex2, std::string s)

Edge *	addEdge (Vertex vertex1, Vertex vertex2, std::string s="")

Edge *	addDirectedEdge (Vertex vertex1, Vertex vertex2, std::string s)

bool	hasEdge (const Edge *edge) const

void	removeEdge (Edge *edge)

const std::set< Edge * > &	edges () const

std::set< Edge * >	edges (const Vertex vertex1, const Vertex vertex2) const

std::set< Edge * >	getEdgesWith (const std::string &s) const

std::set< Edge * >	getEdgesWith (const std::string &s, const T &t) const

iterator	begin ()

iterator	end ()

const_iterator	begin () const

const_iterator	end () const

reverse_iterator	rbegin ()

reverse_iterator	rend ()

const_reverse_iterator	rbegin () const

const_reverse_iterator	rend () const

size_t	order () const

size_t	size () const __attribute__((__deprecated__("use edgeSize() for " "the number of edges. In a future release

size_t	size () will return the " "number properties as it does in GenericObject")))

size_t	edgesSize () const

virtual bool	isUndirected () const

virtual bool	isDirected () const

virtual bool	check (const carto::SyntaxSet &syntax, std::set< std::string > &missing) const

Public Member Functions inherited from GraphObject
virtual	~GraphObject ()

Public Member Functions inherited from carto::SyntaxedObject< PropertySet >
	SyntaxedObject (const std::string &s)

	SyntaxedObject (const SyntaxedObject &x)

	SyntaxedObject (const SyntaxedObject< PropertySet > &x)

	SyntaxedObject (const std::string &s)

	SyntaxedObject (const SyntaxedObject &x)

	SyntaxedObject (const SyntaxedObject< PropertySet > &x)

Additional Inherited Members
Public Types inherited from sigraph::MGraph
enum	VersionStatus { Unversioned , VersionOk , Outdated }
	used for model-data version compatibility check More...

Public Types inherited from Graph
typedef std::set< Vertex * >	VSet

typedef std::set< Edge * >	ESet

typedef carto::rc_ptr< GraphFactory >	FactoryPtr

typedef VSet::value_type	value_type

typedef VSet::pointer	pointer

typedef VSet::reference	reference

typedef VSet::const_reference	const_reference

typedef VSet::iterator	iterator

typedef VSet::const_iterator	const_iterator

typedef VSet::reverse_iterator	reverse_iterator

typedef VSet::const_reverse_iterator	const_reverse_iterator

Public Types inherited from carto::SyntaxedObject< PropertySet >
typedef internal::SyntaxedObjectSwitch< T, SUPERSUBCLASS(Interface, T)>::ContentType	ContentType

Protected Member Functions inherited from sigraph::MGraph
	MGraph (const std::string synt)

virtual void	parseDelete (carto::AttributedObject *ao)

Protected Member Functions inherited from GraphObject
	GraphObject (const std::string &s)

	GraphObject (const GraphObject &x)

Protected Attributes inherited from Graph
FactoryPtr	_factory

Detailed Description

Folds Random graph.

Definition at line 25 of file frgraph.h.

Constructor & Destructor Documentation

◆ FRGraph()

sigraph::FRGraph::FRGraph	(	const std::string	synt = "",
		const std::string	clqDescr = "standard1" )

Constructeur.

Parameters

synt	attribut syntaxique du graphe
clqDescr	type de descripteur de cliques associé

◆ ~FRGraph()

virtual sigraph::FRGraph::~FRGraph ( )

virtual

Member Function Documentation

◆ addEdges()

virtual void sigraph::FRGraph::addEdges	(	const Graph &	gr,
		const Model *	mod )

virtual

Ajoute des "random edges" en liant des labels qui sont effectivement liés dans le graphe exemple.

Les relations ajoutées ont un attribut (non sauvegardé "{\tt occurence_count}" qui donne le nombre de fois que cette relation a été rencontrée dans les exemples. Cet attribut est utilisé par la fonction {\tt removeRareEdges} pour éliminer celles qui sont inhabituelles.

References Graph::Graph().

◆ createFakeRel()

virtual void sigraph::FRGraph::createFakeRel ( )

virtual

Crée la relation FoldFakeRel.

◆ createTriangDomainFiles()

virtual void sigraph::FRGraph::createTriangDomainFiles ( const std::string & dir )

virtual

Crée des fichiers .tri avec les boîtes des domaines.

◆ makeEdge()

virtual Edge * sigraph::FRGraph::makeEdge	(	Vertex *	v1,
		Vertex *	v2,
		const std::string &	label1,
		const std::string &	label2,
		const Model *	mod )

virtual

Crée un "random edge".

◆ modelFinder()

virtual ModelFinder & sigraph::FRGraph::modelFinder ( )

virtual

Renvoie un descripteur de clique adapté au modèle.

Implements sigraph::MGraph.

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

si/fold/frgraph.h

SiGraph: sulcal graphs

Public Member Functions

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ FRGraph()

◆ ~FRGraph()

Member Function Documentation

◆ addEdges()

◆ createFakeRel()

◆ createTriangDomainFiles()

◆ makeEdge()

◆ modelFinder()