static/chunks/766-12dbb05e2adf85ab.js","4150","static/chunks/app/courses/%5BcourseSlug%5D/lessons/%5BunitSlug%5D/page-1fc213a0f4568bd8.js"],"Image"] 3b:T7a3,#include #include #include #include #include #include using namespace std; typedef pair pii; // Pair to represent a node and its distance unordered_map> createGraph() { unordered_map> graph; graph['A'] = {{ 'B', 1 }, { 'C', 4 }}; graph['B'] = {{ 'A', 1 }, { 'C', 2 }, { 'D', 5 }}; graph['C'] = {{ 'A', 4 }, { 'B', 2 }, { 'D', 1 }}; graph['D'] = {{ 'B', 5 }, { 'C', 1 }}; return graph; } unordered_map dijkstra(unordered_map> &graph, char start) { priority_queue, greater> min_heap; unordered_map dist; unordered_set visited; for (auto vertex : graph) { dist[vertex.first] = numeric_limits::max(); // Initial distances are infinity } dist[start] = 0; min_heap.push({ 0, start }); // Push the start node with distance 0 while (!min_heap.empty()) { char u = min_heap.top().second; min_heap.pop(); if (visited.find(u) != visited.end()) { continue; } visited.insert(u); for (auto &neighbor : graph[u]) { char v = neighbor.first; int weight = neighbor.second; if (dist[u] + weight < dist[v]) { dist[v] = dist[u] + weight; min_heap.push({ dist[v], v }); } } } return dist; } int main() { auto graph = createGraph(); char start = 'A'; auto distances = dijkstra(graph, start); for (auto &dist : distances) { cout << "Distance from " << start << " to " << dist.first << " is " << dist.second << endl; } // Output: // Distance from A to A is 0 // Distance from A to B is 1 // Distance fr