Graph Template for c++

graph-template.cpp

struct Node {
  int id;
  unordered_map<int, *Node> neighbours;
};

struct Edge {
  Node *source;
  Node *dest;
  int weight;
};

struct Graph {
  unordered_map<int, *Node> nodes;
  unordered_map< pair<int, int>, *Edge > edges;
};

undirected-uniform-edge.cpp

/*
    Useful when the graph is undirected, and has same edge-lengths across the network.
    Used for problems like DFS, BFS
*/

struct Graph {
	int n, m;
	vector<list<int>> neighbours;
};