sigraph::FGraph Class Reference

Folds graph. More...

#include <si/fold/fgraph.h>

Inheritance diagram for sigraph::FGraph:

Collaboration diagram for sigraph::FGraph:

Public Member Functions
	FGraph (const std::string s="")
virtual	~FGraph ()
virtual void	flipHemispheres ()
Public Member Functions inherited from sigraph::CGraph
	CGraph (std::string s="")
virtual	~CGraph ()
virtual void	deleteCliques ()
const CliqueSet &	cliques () const
CliqueSet &	cliques ()
virtual void	randLabels ()
void	setAllLabels (const std::string &label)
	Met le label donné sur tous les noeuds.
void	ensureAllLabelsPossible ()
	Elimine les labels impossibles au départ.
virtual void	clearAll ()
virtual void	loadBuckets (const std::string &basename, bool rels=false)
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::CGraph
typedef std::set< carto::rc_ptr< Clique > >	CliqueSet
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::CGraph
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 sigraph::CGraph
CliqueSet	_cliques
Protected Attributes inherited from Graph
FactoryPtr	_factory

Detailed Description

Folds graph.

Definition at line 24 of file fgraph.h.

Constructor & Destructor Documentation

FGraph()

sigraph::FGraph::FGraph

(

const std::string

s = ""

)

~FGraph()

virtual sigraph::FGraph::~FGraph ( )

virtual

Member Function Documentation

flipHemispheres()

virtual void sigraph::FGraph::flipHemispheres ( )

virtual

---

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

• si/fold/fgraph.h