{"id":146079,"date":"2025-07-23T12:15:00","date_gmt":"2025-07-23T06:45:00","guid":{"rendered":"https:\/\/data-flair.training\/blogs\/?p=146079"},"modified":"2025-07-23T12:15:00","modified_gmt":"2025-07-23T06:45:00","slug":"city-map-navigation-in-dsa-cpp","status":"publish","type":"post","link":"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/","title":{"rendered":"DSA C++ Project &#8211; City Map Navigation"},"content":{"rendered":"<h3>Program 1<\/h3>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"generic\">\/\/Project Title: City Map Navigation using Graphs\r\n\/*\r\nObjective:\r\nTo build a simple navigation system that finds the shortest path between a source city \r\nand all other cities using Dijkstra's Algorithm \u2014 one of the most efficient ways to compute \r\nshortest paths in a weighted graph.\r\n\r\nData Structures Used:\r\n\r\nGraph (Adjacency Matrix):\r\nStores the map as a 2D array where each cell adjMatrix[i][j] \r\nrepresents the distance between city i and city j.\r\nIf there is no direct road, the distance is set to a high value (INF).\r\nArrays:\r\n\r\ndist[]: To hold the minimum distances from the source city.\r\nvisited[]: To keep track of cities already included in the shortest path tree.\r\nprev[]: To reconstruct the path (stores the previous city for each destination).\r\n\r\nProject Work Flow:\r\n\r\n1. City and Road Input:\r\nThe user first inputs how many cities are in the map.\r\nFor each city, a name is provided (e.g., \"Indore\", \"Pune\").\r\nThe user then enters how many roads exist and the distance between city pairs using their indices.\r\n\r\nOption 1: Show Adjacency Matrix\r\n\r\nDisplays a table of all city-to-city distances.\r\nUseful for visualizing the city graph.\r\n\r\nOption 2: Find Shortest Paths\r\n\r\nUser selects a source city.\r\nThe program uses Dijkstra\u2019s algorithm to calculate the shortest distances from the \r\nsource to all other cities.\r\nIt also prints the actual path taken from the source to each city.\r\n\r\nOption 3: Exit\r\n*\/\r\n\r\n#include &lt;iostream&gt;\r\n#include &lt;climits&gt;\r\n#include &lt;cstring&gt;\r\n#include &lt;windows.h&gt;\r\nusing namespace std;\r\n\r\n#define MAX 100 \r\n#define INF 99999\r\n\r\nclass Graph \r\n{\r\nprivate:\r\n    int numCities;\r\n    int adjMatrix[MAX][MAX];\r\n    char cityNames[MAX][50];\r\n\r\npublic:\r\n    Graph(int n)   \r\n    {\r\n        numCities = n;\r\n        for (int i = 0; i &lt; numCities; i++)\r\n            for (int j = 0; j &lt; numCities; j++)\r\n                adjMatrix[i][j] = (i == j) ? 0 : INF;  \r\n    }\r\n\r\n    void addCity(int index, const char* name) \r\n    {\r\n        strcpy(cityNames[index], name);\r\n    }\r\n                             \/\/0        3           500\r\n    void addRoad(int src, int dest, int distance) \r\n    {\r\n        adjMatrix[src][dest] = distance;\r\n        adjMatrix[dest][src] = distance; \/\/ for undirected graph\r\n    }\r\n\r\n    void displayMatrix() \r\n    {\r\n        cout &lt;&lt; \"\\nAdjacency Matrix:\\n\";\r\n        for (int i = 0; i &lt; numCities; i++) \r\n        {\r\n            for (int j = 0; j &lt; numCities; j++) \r\n            {\r\n                if (adjMatrix[i][j] == INF)\r\n                    cout &lt;&lt; \"INF\\t\";\r\n                else\r\n                    cout &lt;&lt; adjMatrix[i][j] &lt;&lt; \"\\t\";\r\n            }\r\n            cout &lt;&lt; endl;\r\n        }\r\n    }\r\n\r\n    void dijkstra(int start)        \/\/ Indore   0\r\n    {\r\n        int dist[MAX], visited[MAX], prev[MAX];\r\n\r\n        for (int i = 0; i &lt; numCities; i++) \r\n        {\r\n            dist[i] = INF;  \r\n            visited[i] = 0;\r\n            prev[i] = -1;\r\n        }\r\n\r\n        dist[start] = 0;\r\n\r\n        for (int count = 0; count &lt; numCities - 1; count++) \r\n        {\r\n            int min = INF, u = -1;    \r\n\r\n            for (int v = 0; v &lt; numCities; v++) \r\n            {\r\n                if (!visited[v] &amp;&amp; dist[v] &lt;= min) \r\n                {\r\n                    min = dist[v];        \/\/  min =0\r\n                    u = v;                    \/\/ u =0 \r\n                }\r\n            }\r\n\r\n            if (u == -1) break;\r\n            visited[u] = 1;\r\n\r\n            for (int v = 0; v &lt; numCities; v++) \r\n            {\r\n                if (!visited[v] &amp;&amp; adjMatrix[u][v] &amp;&amp; dist[u] != INF &amp;&amp;\r\n                    dist[u] + adjMatrix[u][v] &lt; dist[v]) \r\n                    {\r\n                        dist[v] = dist[u] + adjMatrix[u][v];\r\n                        prev[v] = u;\r\n                }\r\n            }\r\n        }\r\n\r\n        cout &lt;&lt; \"\\nShortest paths from: \" &lt;&lt; cityNames[start] &lt;&lt; endl;\r\n        for (int i = 0; i &lt; numCities; i++) {\r\n            if (i != start) {\r\n                cout &lt;&lt; \"To \" &lt;&lt; cityNames[i] &lt;&lt; \" - Distance: \" &lt;&lt; dist[i] &lt;&lt; \" - Path: \";\r\n                printPath(prev, i);\r\n                cout &lt;&lt; cityNames[i] &lt;&lt; endl;\r\n            }\r\n        }\r\n    }\r\n\r\n    void printPath(int prev[], int j) \r\n    {\r\n        if (prev[j] == -1)\r\n            return;\r\n        printPath(prev, prev[j]);\r\n        cout &lt;&lt; cityNames[prev[j]] &lt;&lt; \" -&gt; \";\r\n    }\r\n};\r\n\r\nint main() \r\n{\r\n     SetConsoleOutputCP(CP_UTF8);   \/\/ For Emojies\r\n    int n, choice;\r\n    cout &lt;&lt; \"Enter number of cities: \";\r\n    cin &gt;&gt; n;              \r\n\r\n    Graph g(n);      \r\n    cin.ignore();\r\n\r\n    for (int i = 0; i &lt; n; i++) \r\n    {\r\n        char name[50];\r\n        cout &lt;&lt; \"Enter name for city \" &lt;&lt; i &lt;&lt; \": \";\r\n        cin.getline(name, 50);\r\n        g.addCity(i, name);\r\n    }\r\n\r\n    int roads;\r\n    cout &lt;&lt; \"Enter number of roads: \";\r\n    cin &gt;&gt; roads;   \/\/4\r\n\r\n    for (int i = 0; i &lt; roads; i++)    \/\/4 \r\n    {\r\n        int src, dest, dist;\r\n        cout &lt;&lt; \"Enter road \" &lt;&lt; i + 1 &lt;&lt; \" (src_index dest_index distance): \";\r\n        cin &gt;&gt; src &gt;&gt; dest &gt;&gt; dist;\r\n        g.addRoad(src, dest, dist);\r\n    }\r\n\r\n    do\r\n     {\r\n        cout &lt;&lt; \"\\n==== City Navigation Menu ====\\n\";\r\n        cout &lt;&lt; \"1. Show Adjacency Matrix\\n\";\r\n        cout &lt;&lt; \"2. Find Shortest Paths from City\\n\";\r\n        cout &lt;&lt; \"3. Exit\\n\";\r\n        cout &lt;&lt; \"Enter your choice: \";\r\n        cin &gt;&gt; choice;\r\n\r\n        switch (choice) \r\n        {\r\n        case 1:\r\n            g.displayMatrix();\r\n            break;\r\n        case 2:\r\n            int src;\r\n            cout &lt;&lt; \"Enter source city index: \";\r\n            cin &gt;&gt; src; \/\/ Indore     \r\n            g.dijkstra(src);  \/\/ Indore\r\n            break;\r\n        case 3:\r\n            cout &lt;&lt; \"Exiting. \\n\";\r\n            break;\r\n        default:\r\n            cout &lt;&lt; \"Invalid choice.\\n\";\r\n        }\r\n\r\n    } while (choice != 3);\r\n\r\n    return 0;\r\n}<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Program 1 \/\/Project Title: City Map Navigation using Graphs \/* Objective: To build a simple navigation system that finds the shortest path between a source city and all other cities using Dijkstra&#8217;s Algorithm \u2014&#46;&#46;&#46;<\/p>\n","protected":false},"author":581,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[31449],"tags":[34953,34954,34956,34955,32874,34957,32869,32870,34887],"class_list":["post-146079","post","type-post","status-publish","format-standard","hentry","category-dsa-cpp-tutorials","tag-city-map-navigation","tag-city-map-navigation-in-dsa-c","tag-city-map-navigation-project","tag-city-map-navigation-using-dsa-c","tag-dsa-c","tag-dsa-c-city-map-navigation-project","tag-dsa-c-practical","tag-dsa-c-program","tag-dsa-c-project"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>DSA C++ Project - City Map Navigation - DataFlair<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"DSA C++ Project - City Map Navigation - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Program 1 \/\/Project Title: City Map Navigation using Graphs \/* Objective: To build a simple navigation system that finds the shortest path between a source city and all other cities using Dijkstra&#039;s Algorithm \u2014&#046;&#046;&#046;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/\" \/>\n<meta property=\"og:site_name\" content=\"DataFlair\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/DataFlairWS\/\" \/>\n<meta property=\"article:published_time\" content=\"2025-07-23T06:45:00+00:00\" \/>\n<meta name=\"author\" content=\"DataFlair Team\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:site\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"DataFlair Team\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"DSA C++ Project - City Map Navigation - DataFlair","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/","og_locale":"en_US","og_type":"article","og_title":"DSA C++ Project - City Map Navigation - DataFlair","og_description":"Program 1 \/\/Project Title: City Map Navigation using Graphs \/* Objective: To build a simple navigation system that finds the shortest path between a source city and all other cities using Dijkstra's Algorithm \u2014&#46;&#46;&#46;","og_url":"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2025-07-23T06:45:00+00:00","author":"DataFlair Team","twitter_card":"summary_large_image","twitter_creator":"@DataFlairWS","twitter_site":"@DataFlairWS","twitter_misc":{"Written by":"DataFlair Team","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/"},"author":{"name":"DataFlair Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/c187795dc82ab948373cca526df7c445"},"headline":"DSA C++ Project &#8211; City Map Navigation","datePublished":"2025-07-23T06:45:00+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/"},"wordCount":9,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"keywords":["city map navigation","city map navigation in dsa c++","city map navigation project","city map navigation using dsa c++","dsa c++","dsa c++ city map navigation project","dsa c++ practical","dsa c++ program","dsa c++ project"],"articleSection":["DSA using C++ Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/","url":"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/","name":"DSA C++ Project - City Map Navigation - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"datePublished":"2025-07-23T06:45:00+00:00","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/city-map-navigation-in-dsa-cpp\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Blog Home","item":"https:\/\/data-flair.training\/blogs\/"},{"@type":"ListItem","position":2,"name":"DSA using C++ Tutorials","item":"https:\/\/data-flair.training\/blogs\/category\/dsa-cpp-tutorials\/"},{"@type":"ListItem","position":3,"name":"DSA C++ Project &#8211; City Map Navigation"}]},{"@type":"WebSite","@id":"https:\/\/data-flair.training\/blogs\/#website","url":"https:\/\/data-flair.training\/blogs\/","name":"DataFlair","description":"Learn Today. Lead Tomorrow.","publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/data-flair.training\/blogs\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/data-flair.training\/blogs\/#organization","name":"DataFlair","url":"https:\/\/data-flair.training\/blogs\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/","url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","contentUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","width":106,"height":48,"caption":"DataFlair"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/DataFlairWS\/","https:\/\/x.com\/DataFlairWS","https:\/\/www.linkedin.com\/company\/dataflair-web-services-pvt-ltd\/","https:\/\/www.youtube.com\/user\/DataFlairWS"]},{"@type":"Person","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/c187795dc82ab948373cca526df7c445","name":"DataFlair Team","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/2302ebc438084d2f1f993edc1996a0aae01332e81f3227cba8df0c48ec010ca4?s=96&d=mm&r=g","caption":"DataFlair Team"},"description":"DataFlair Team provides high-impact content on programming, Java, Python, C++, DSA, AI, ML, data Science, Android, Flutter, MERN, Web Development, and technology. We make complex concepts easy to grasp, helping learners of all levels succeed in their tech careers.","url":"https:\/\/data-flair.training\/blogs\/author\/dfteam6\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146079","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/users\/581"}],"replies":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/comments?post=146079"}],"version-history":[{"count":2,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146079\/revisions"}],"predecessor-version":[{"id":146089,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/146079\/revisions\/146089"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=146079"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=146079"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=146079"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}