Antares::Graph::Grid< NodeT > Class Template Reference

Antares Grid (graph) More...

#include <grid.h>

Public Types
typedef Antares::Graph::Node< NodeT > *	NodeP
typedef Antares::Graph::Edge< NodeT > *	EdgeP
typedef std::vector< NodeP >	VectorNodeP
typedef std::vector< EdgeP >	VectorEdgeP
typedef std::map< NodeP, NodeP >	MapNodes
typedef std::vector< bool >	EdgeIncidence

Constructor & Destructor
	Grid ()
	Constructor.
	~Grid ()
	Destructor.
NodeP	addNode (NodeT &, std::string)
	Add one node to the graph.
EdgeP	addEdge (NodeP, NodeP, long weight=0)
	Add one edge to the graph.
uint	getNumberOfConnectedComponents ()
VectorEdgeP	findShortestPath (NodeP node1, NodeP node2) const
	Find shortest path between the two nodes (Djikstra)
EdgeP	findEdgeFromNodeNames (std::string u, std::string v)
	find an edge from node names
EdgeP	findDrivingEdgeFromNodeNames (std::string u, std::string v)
void	removeEdge (EdgeP e)
NodeP	findNodeFromName (std::string name)
	find a node from it's name
void	kruskal ()
	Kruskal algorithm.
bool	buildMesh ()
	Get minimum spanning tree.
const std::vector< std::vector< int > > &	getMeshIndexMatrix ()
	Get the min cycle basis mesh.
VectorEdgeP	twoLevelPath (VectorNodeP vN)
bool	getDuplicatedGrid (Grid &)
	get a Gid where edges and nodes are duplicated
bool	cloneGrid (Grid &)
	get a clone of the Grid
const VectorEdgeP &	getEdges ()
EdgeIncidence	getIncidenceVector (VectorEdgeP vE)
EdgeIncidence	getIncidenceVector (EdgeP vE)
VectorEdgeP	getEdgeVectorFromIncidence (EdgeIncidence vI)
EdgeIncidence	incidenceXOR (EdgeIncidence &e1, EdgeIncidence &e2)
int	incidenceInnerProduct (EdgeIncidence &e1, EdgeIncidence &e2)
void	clear ()

Detailed Description

template<class NodeT>
class Antares::Graph::Grid< NodeT >

Antares Grid (graph)

Member Function Documentation

buildMesh()

template<class NodeT >

bool Antares::Graph::Grid< NodeT >::buildMesh

(

)

Get minimum spanning tree.

Build pMesh

the smallest set of loops meshing the graph

vecteur contenant les sommets adjacents aux arêtes Ei

extraction du chemin sur deux niveaux

définition du cycle correspondant dans le graph d'origine (non signé)

cloneGrid()

template<class NodeT >

bool Antares::Graph::Grid< NodeT >::cloneGrid

(

Grid< NodeT > &

grid

)

get a clone of the Grid

get a clone of the grid

Parameters

a	reference to a virgin grid object

getDuplicatedGrid()

template<class NodeT >

bool Antares::Graph::Grid< NodeT >::getDuplicatedGrid

(

Grid< NodeT > &

grid

)

get a Gid where edges and nodes are duplicated

get a Grid where each edge and node is duplicated and signed

Parameters

a	reference to a virgin grid object

getMeshIndexMatrix()

template<class NodeT >

const std::vector< std::vector< int > > & Antares::Graph::Grid< NodeT >::getMeshIndexMatrix ( )

inline

Get the min cycle basis mesh.

the smallest set of loops meshing the graph

kruskal()

template<class NodeT >

void Antares::Graph::Grid< NodeT >::kruskal

(

)

Kruskal algorithm.

Search for the minimum spanning tree of the graph Saved in pMinSpanningTree

---

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

• src/solver/constraints-builder/include/antares/solver/constraints-builder/grid.h
• src/solver/constraints-builder/include/antares/solver/constraints-builder/grid.hxx