hypergraphlib_graph.h

Aller à la documentation de ce fichier.

//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//  MAGiC
//####//  Jean Christophe Cuilliere et Vincent FRANCOIS
//####//  Departement de Genie Mecanique - UQTR
//####//------------------------------------------------------------
//####//  MAGIC est un projet de recherche de l equipe ERICCA
//####//  du departement de genie mecanique de l Universite du Quebec a Trois Rivieres
//####//  http://www.uqtr.ca/ericca
//####//  http://www.uqtr.ca/
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//
//####//       hypergraphlib_graph.h
//####//
//####//------------------------------------------------------------
//####//------------------------------------------------------------
//####//    COPYRIGHT 2000-2024
//####//  jeu 13 jun 2024 11:54:00 EDT
//####//------------------------------------------------------------
//####//------------------------------------------------------------
#ifndef GRAPHH
#define GRAPHH
 
#include <map>
#include <set>
#include <vector>
 
#include "hypergraphlib_graphobject.h"
 
#define GRAPH_FOR_EACH_ARC_CONST(G,A)                            \
    for (HypergraphLib::Graph::MapArcsById::const_iterator A = G->GetArcs().begin();    \
         A != G->GetArcs().end();                          \
         A++)
 
#define GRAPH_FOR_EACH_ARC(G,A)                            \
    for (HypergraphLib::Graph::MapArcsById::iterator A = G->GetArcs().begin();    \
         A != G->GetArcs().end();                          \
         A++)
 
#define GRAPH_FOR_EACH_NODE_CONST(G,N)                \
    for (HypergraphLib::Graph::MapNodesById::const_iterator N = G->GetNodes().begin();    \
         N != G->GetNodes().end();                          \
         N++)
 
#define GRAPH_FOR_EACH_NODE(G,N)                \
    for (HypergraphLib::Graph::MapNodesById::iterator N = G->GetNodes().begin();    \
         N != G->GetNodes().end();                          \
         N++)
 
 
 
namespace HypergraphLib {
 
class Node;
class Arc;
 
class HYPERGRAPHLIB_ITEM Graph : public GraphObject {
public:
    typedef std::map < int, Arc * > MapArcsById;
    typedef std::map < int, Node * > MapNodesById;
 
    ~Graph();
 
    Graph(int __id=0);
 
    Graph(const Graph &__G, int __clone=1, int __reverse=0);
 
    Graph(const Graph &__G, const std::set  <Node *> & );
    Graph(const Graph &__G, const std::vector <Node*> & __nodes);
 
    Node * GetNode (int) const;
 
 
    Node* MergeNodes(Node *__A, Node *__B, int __id, bool __keepNodes=false);
    Node* MergeNodes(int   __A,int    __B, int __id, bool __keepNodes=false);
 
    Arc * GetArc (int) const;
 
    int RemoveNode (int __id);
 
    int RemoveNode (Node *);
 
    int RemoveArc (int __id);
 
    int RemoveArc (Arc *);
 
    Node * AddNode (int __id=0);
 
    Arc * AddArc (const std::vector<int> &, int __id);
 
    Arc * AddArc(const int __id, int __rank, ...);
 
    Arc * AddArc(const int __id, const std::multimap<int, Node*> & __nodes);
 
    int CheckFreeNodeId(int __id) const;
 
    int CheckFreeArcId(int __id) const;
 
    int GetMaxArcId();
 
    int GetMaxNodeId();
 
    const MapArcsById & GetArcs()const {
        return _arcs;
    } ;
 
    const MapNodesById & GetNodes()const {
        return _nodes;
    } ;
 
    void CheckIntegrity()const;
 
    void Filaments (  std::vector < std::vector < int > > & __filaments );
 
    bool IsCycle () const;
    bool IsCycle (const std::vector < Node * > & __nodes) const;
 
    Arc * DuplicateArc(int __id, int __dupId);
    Arc * DuplicateArc(Arc * __arc, int __dupId);
 
protected:
    MapArcsById _arcs;
    MapNodesById _nodes;
};
 
} // end namespace HypergraphLib
 
 
#endif // GRAPH_H