GPM_Types.h

Go to the documentation of this file.

#ifndef GPM_Types_H
#define GPM_Types_H

#include "CORE_Object.h"

#include <boost/graph/adjacency_list.hpp>

DEFINE_SPTR(GPM_Vertex);
DEFINE_SPTR(GPM_Edge);
DEFINE_SPTR(GPM_Graph);

// *******
// Data 1
// *******


struct VertexProperties {
    tString groupId;
    SP::GPM_Vertex vertex; 
};


struct EdgeProperties {
    SP::GPM_Edge edge; 
};

// the definition of graph type
typedef boost::adjacency_list<boost::listS,//container for edges leaving from a vertex
                              boost::vecS,//container for all graph's vertices
                              //boost::hash_setS,//container for all graph's vertices
                              //boost::bidirectionalS,// 2 oriented edges in both direction or
                              //boost::directedS,//oriented edge or
                              boost::undirectedS,//unoriented edge
                              VertexProperties, // vertex properties
                              EdgeProperties//edge properties
                              > tGraph;

// vertex property fields
typedef boost::property_map<tGraph, boost::vertex_index_t>::type tVertexIIdMap;
typedef boost::property_map<tGraph, boost::vertex_index_t>::const_type tVertexIIdConstMap;

// edge property fields

// the definition of vertex id type
typedef tGraph::vertex_descriptor tVertexIID;
// the vertex iterator
typedef boost::graph_traits<tGraph>::vertex_iterator tVertexIterator;

// the definition of edge id type
typedef tGraph::edge_descriptor   tEdgeIID;
// the edge iterator
typedef boost::graph_traits<tGraph>::edge_iterator tEdgeIterator;
// the in edge iterator
typedef boost::graph_traits<tGraph>::in_edge_iterator tInEdgeIterator;

// the graph iterator
typedef std::pair <boost::graph_traits<tGraph>::adjacency_iterator,
                   boost::graph_traits<tGraph>::adjacency_iterator> tGraphIterator;

// //morphism maps
// typedef boost::property_map<tGraph,GPM_Vertex>::type tVertexNameMap;
// typedef boost::property_map_equivalent<tVertexNameMap,tVertexNameMap> tVertexComp;

// typedef boost::property_map<tGraph,boost::edge_name_t>::type tEdgeNameMap;
// typedef boost::property_map_equivalent<tEdgeNameMap,tEdgeNameMap> tEdgeComp;


//*******
// Data 2
//*******
// // vertex property
// typedef boost::property<boost::vertex_index1_t, int,
//                         boost::property<boost::vertex_name_t, tString>
//                         > vertex_property;


// //edge property
// typedef boost::property<boost::edge_index_t, int,
//                         boost::property<boost::edge_name_t, tString>
//                         > edge_property;

// // the definition of graph type
// typedef boost::adjacency_list<boost::listS,//container for edges leaving from a vertex
//                               boost::vecS,//container for all graph's vertices
//                               //boost::hash_setS,//container for all graph's vertices
//                               //boost::bidirectionalS,// 2 oriented edges in both direction or
//                               //boost::directedS,//oriented edge or
//                               boost::undirectedS,//unoriented edge
//                               vertex_property, // vertex properties
//                               edge_property //edge property
//                               > tGraph;

// // vertex property fields
// typedef boost::property_map<tGraph, boost::vertex_index_t>::type tVertexIIdMap;
// typedef boost::property_map<tGraph, boost::vertex_index_t>::const_type tVertexIIdConstMap;
// typedef boost::property_map<tGraph, boost::vertex_index1_t>::type tVertexIdMap;
// typedef boost::property_map<tGraph, boost::vertex_index1_t>::const_type tVertexIdConstMap;
// typedef boost::property_map<tGraph, boost::vertex_name_t>::type tVertexTypeMap;
// typedef boost::property_map<tGraph, boost::vertex_name_t>::const_type tVertexTypeConstMap;

// // edge property fields
// typedef boost::property_map<tGraph, boost::edge_index_t>::type tEdgeIdMap;
// typedef boost::property_map<tGraph, boost::edge_index_t>::const_type tEdgeIdConstMap;
// typedef boost::property_map<tGraph, boost::edge_name_t>::type tEdgeTypeMap;
// typedef boost::property_map<tGraph, boost::edge_name_t>::const_type tEdgeTypeConstMap;

// // the definition of vertex id type
// typedef tGraph::vertex_descriptor tVertexIID;
// // the vertex iterator
// typedef boost::graph_traits<tGraph>::vertex_iterator tVertexIterator;

// // the definition of edge id type
// typedef tGraph::edge_descriptor   tEdgeIID;
// // the edge iterator
// typedef boost::graph_traits<tGraph>::edge_iterator tEdgeIterator;

// // the graph iterator
// typedef std::pair <boost::graph_traits<tGraph>::adjacency_iterator,
//                    boost::graph_traits<tGraph>::adjacency_iterator> tGraphIterator;

// // //morphism maps
// // typedef boost::property_map<tGraph,GPM_Vertex>::type tVertexNameMap;
// // typedef boost::property_map_equivalent<tVertexNameMap,tVertexNameMap> tVertexComp;

// // typedef boost::property_map<tGraph,boost::edge_name_t>::type tEdgeNameMap;
// // typedef boost::property_map_equivalent<tEdgeNameMap,tEdgeNameMap> tEdgeComp;




#endif