#ifndef _GRAPH_H_
#define _GRAPH_H_

#include <vector>
#include <list>
#include <unordered_map>
#include <utility>
#include <iostream>

template <class V>
class Graph{
  std::vector<std::list<std::pair<size_t, double>>> _edges;
  std::vector<V> _long_names;
  std::unordered_map<V, size_t> _short_names;
  bool _directional;
public:
  Graph(bool directional = false);
  void add_vertex(const V& name);
  void add_edge(const V& name1, const V& name2, double lenght = 1);
  bool has_vertex(const V& name) const;
  bool has_edge(const V& name1, const V& name2) const;
  void print() const;
private:
  void _add_edge(const V& name1, const V& name2, double lenght);
};

#include "GraphCode.h"

#endif //_GRAPH_H