GraphBuilder.h

Go to the documentation of this file.

#pragma once

#include <Core/ExecObject.h>
#include <Core/core_defines2.h>
#include <time.h>

#include <algorithm>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/graph_utility.hpp>
#include <boost/graph/graphviz.hpp>
#include <boost/graph/isomorphism.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/topological_sort.hpp>
#include <boost/graph/visitors.hpp>
#include <boost/utility.hpp>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <set>
#include <vector>
#include <string>



typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_name_t, std::string> > ObjectGraph_Type;

/*
typedef boost::adjacency_list<
    boost::listS,
    boost::listS,
    boost::bidirectionalS,
    boost::property<boost::vertex_index_t, long,
    boost::property<boost::vertex_name_t, std::string   >>
    > ObjectGraph_Type;
*/


typedef ObjectGraph_Type::vertex_descriptor Object_Vertex;



namespace Core
{
class CORE_EXPORT ObjectGraph
{
public:
    ObjectGraph();
    // Copy constructor
    ObjectGraph(const ObjectGraph& rhs);

    ObjectGraph(std::vector<Core::DocObject*> objs, bool ignoreLinksToTemporaryObjects = false);
    ~ObjectGraph();

    void clear();
    bool addObject(const Core::DocObject* o);
    bool removeObject(const Core::DocObject* o);
    bool updateObject(const Core::DocObject* o);
    bool hasObject(const Core::DocObject* o) const;


    bool recreate(std::vector<const Core::DocObject*> toDelete);
    bool allLinksConnected();

    bool updateObject_BackLink(const Core::DocObject* o);

    std::vector<Core::DocObject*> build_SubGraph(const std::vector<Core::DocObject*>& featureSet);

    std::vector<const Core::DocObject*> getInner(const Core::DocObject* o, std::function<bool(const Core::DocObject*)>* allowToAddObject = 0);
    std::vector<const Core::DocObject*> getOuter(const Core::DocObject* o);


    std::vector<const Core::DocObject*> getTopologicalSorted();

    std::vector<const Core::DocObject*> getLinksToMe(const Core::DocObject* o);
    std::vector<const Core::DocObject*> getLinksFromMe(const Core::DocObject* o);

    std::vector<const Core::DocObject*> getBackLinksToMe(const Core::DocObject* o);
    std::vector<const Core::DocObject*> getBackLinksFromMe(const Core::DocObject* o);

    bool checkForCycle();
    std::string dump();
    std::vector< std::string > getErrors();

private:
    bool addObjectLinks(const Core::DocObject* o);
    std::string dumpSort(ObjectGraph_Type g);
    ObjectGraph_Type build(const std::vector<Core::DocObject*>& featureSet, std::map<size_t, Core::DocObject*>& myFeaturemap);

    void getOuter(Object_Vertex& vertex, std::vector<const Core::DocObject*>& behindobjects);
    void getInner(Object_Vertex& vertex,
                  std::set<const Core::DocObject*>& beforeobjects,
                  std::function<bool(const Core::DocObject*)>* allowToAddObject);
    void getInner(Object_Vertex& vertex,
                  std::vector<const Core::DocObject*>& beforeobjects,
                  std::function<bool(const Core::DocObject*)>* allowToAddObject);
    boost::unordered_map<Object_Vertex, const Core::DocObject*> _vertex_to_object;
    boost::unordered_map<const Core::DocObject*, Object_Vertex> _object_to_vertex;

    boost::unordered_map<Object_Vertex, const Core::DocObject*> _vertex_to_object_BackLink;
    boost::unordered_map<const Core::DocObject*, Object_Vertex> _object_to_vertex_BackLink;

    ObjectGraph_Type* _objectGraph;
    ObjectGraph_Type* _objectGraphBackLinks;
    bool _ignoreLinksToTemporaryObjects = false;

    std::vector< std::string > mErrors;
    
};



}  // namespace Core