Graph.h

Go to the documentation of this file.

/***************************************
        Auteur : Pierre Aubert
        Mail : pierre.aubert@lapp.in2p3.fr
        Licence : CeCILL-C
****************************************/
 
#ifndef __GRAPH_H__
#define __GRAPH_H__
 
#include <fstream>
#include <map>
#include <vector>
#include "Node.h"


template<typename T, typename UIdx>
class Graph{
        public:
                Graph();
                Graph(const Graph<T, UIdx> & other);
                virtual ~Graph();
                Graph & operator = (const Graph<T, UIdx> & other);
                
                bool savePng(const std::string & fileNamePng) const;
                bool saveDot(const std::string & fileName) const;
                bool saveDot(std::ofstream & fs) const;
                std::string toDot() const;
                
                UIdx createNode(const T & data, const std::string & name);
                Node<T, UIdx> * createNodePtr(const T & data, const std::string & name);
                
                bool createNode(const T & data, const UIdx & index, const std::string & name);
                Node<T, UIdx> * createNodePtr(const T & data, const UIdx & index, const std::string & name);
                
                void clearIsUpdated();
                void clearMapNode();
                void clearFirstNode();
                void clearLastNode();
                void clearAll();
                
                void removeNode(UIdx index, bool reconnectParentToChildren = false);
                
                void updateFirstLastNode();
                
                void connectNode(UIdx parent, UIdx child);
                void connectNode(UIdx parent, const std::list<UIdx> & listChildren);
                void connectNode(UIdx parent, const std::vector<UIdx> & vecChildren);
                
                const Node<T, UIdx> * getNode(UIdx index) const;
                Node<T, UIdx> * getNode(UIdx index);
                
                const Node<T, UIdx> * getFirstNotUpdatedNode() const;
                Node<T, UIdx> * getFirstNotUpdatedNode();
                
                bool isNodeExist(UIdx index) const;
                
                size_t size() const;
                const std::list<UIdx> & getListFirstNode() const;
                const std::list<UIdx> & getListLastNode() const;
                
                bool iterateChildren(std::list<UIdx> & listNode) const;
                bool iterateParent(std::list<UIdx> & listNode) const;
                
                bool isListNodeUdpated(const std::list<UIdx> & listNode) const;
                bool iterateChildrenCheckUpdate(std::list<UIdx> & listNode);
                bool iterateParentCheckUpdate(std::list<UIdx> & listNode);
                
        protected:
                void copyGraph(const Graph<T, UIdx> & other);
                
        private:
                void initialisationGraph();
                
                std::map<UIdx, Node<T, UIdx> > p_mapNode;
                std::list<UIdx> p_listFirstNode;
                std::list<UIdx> p_listLastNode;
};
 
#include "Graph_impl.h"
 
 
#endif