Define struct SBGraph

[joaquinffernandez]

[joaquinffernandez]

Branch of sb-graph-dev and set a dev branch for structure/dep computation algorithms and we should work there all the tickets with structure label.

We should define a new extended graph (maybe in a new structure folder in algorithms) that uses a sbg directed graph and keeps track of the user data of each set/edge using the graphs V and E maps, also we should extend the interface to allow the insertion of user data:

namespace SBG {

namespace Struct {

template<typename NodeUserData, typename EdgeUserData>
class ESBG  {
  using NodeUserDataMap = std::map<MD_NAT, NodeUserData>;
  using EdgeUserDataMap = std::map<MD_NAT, EdgeUserData>;
...

private:
  NodeUserDataMap _node_user_data_map;
  EdgeUserDataMap _edge_user_data_map;
 SBG::LIB::DSBG _graph;
}

For instance, we can extend addSV in the following way:

  StructSBG addSV(const Set &vertices, NodeUserData user_data ) const {
    _graph =  _graph.addSV(vertices);
   PWMap v_map = _graph.Vmap()
   _node_user_data_map.insert({v_map.image(vertices), user_data});
  }

After the initial graph implementation is defined, we can write the initial structure graph:

namespace SBG {

namespace Struct {

enum class NodeType { Equation, Influencer, Algebraic, Influencee, Statement, Derivative };

struct StructNodeData {
  NodeType type;
  bool visited;
};

template <typename NodeUserData, typename EdgeUserData>
class StructSBG : public ESBG<NodeUserData, EdgeUserData> {
  ...
  using StructNodeDataMap = std::map<MD_NAT, StructNodeData>;

  private:
  StructNodeDataMap _struct_node_data_map; 

};

Finally we should be able to automatically create a graph from a given JSON input file #130.