Data Structures: Weighted Graph with Dijkstra's Shortest Path & BFS

Implement a Weighted Graph in C++ with fundamental graph traversal and routing algorithms:

• ◦
  int numVertices.
• ◦
  std::vector<std::vector<std::pair<int, int>>> adjList: Stores (destination, weight) pairs for each vertex.

• ◦
  void addEdge(int u, int v, int weight, bool bidirectional = false): Adds weighted connection.
• ◦
  void bfs(int startVertex) const: Breadth-First Search traversal using a queue.
• ◦
  void dfs(int startVertex) const: Depth-First Search traversal using recursion.
• ◦
  bool hasCycle() const: Detects cycles in graph.
• ◦
  std::pair<int, std::vector<int>> dijkstra(int start, int target) const:
• ◦
  Computes shortest path distance using std::priority_queue.
• ◦
  Reconstructs and returns the exact path array from start to target using a parent[] array.

• ◦
  Construct a network topology with 6 nodes (0 to 5) and weighted edges.
• ◦
  Execute BFS and DFS from node 0.
• ◦
  Run Dijkstra from node 0 to node 5, printing the minimum total path cost and the reconstructed route.