[Q1] Returns true if the graph can be considered an undirected graph. I.e. if for every edge v -> w there is also an edge w -> v with exactly the same weight. bool is_undirected() const

23 24 // Represents a directed weighted graph. Can also 25 // be used to represent an undirected weighted graph. 26 class Graph { 27 private: 28 int V; // number of vertices 29 list *adj; // adjacency lists 30 31 public: 32 Graph(int V) { 33 this-> = V; 34 adj = new list [V]; 35 36 -Graph() { delete [] adj; } 37 int get_V) const { return V; } 38 39 40 42 42 Hadds an edge from v to w with the given weight void add_edge (int v, int w, double weight) { if (weight