Shortest Path Finder #36
Closed
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
It's great having you contribute to this projectThank you for opening a Pull Request 🙌 , Welcome to SkillShow 💖 We will review everything and get back to you :) |
Kushal997-das
added
the
hacktoberfest2024
Comment on lines
1
to
7
| A B 5 | ||
| A C 10 | ||
| B D 3 | ||
| C D 1 | ||
| D E 2 | ||
| B E 9 | ||
| C E 4 |
There was a problem hiding this comment.
The transit.txt file is required because it serves as the input data source for the program, representing the city's transit network. It contains information about all the transit stops and the connections between them, including the travel time (or weight) for each connection.
Kushal997-das
requested changes
Oct 17, 2024
Kushal997-das
added
the
Hold
|
Updated and completed the required changes in pull request Shortest Path Finder #97 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
SkillShow! 🎊🎈
Welcome! 🎉
Thank you for visiting our repository! We're excited to have you here. If you find this project useful, please consider giving it a star! ⭐
🎉 Have you reviewed the Contributing Guidelines? 🤔 (Required)
📝 Description
In many cities, commuters face challenges in determining the quickest or most efficient route between their starting location and destination, especially when there are multiple transit stops and potential routes to choose from. Without a clear method to find the shortest or fastest path, travelers may end up taking longer, indirect routes or waiting unnecessarily.
🔧 Fixes #35 (Required)
🏷️ Initiative Participation (Required)
This pull request is associated with the following initiative. Please choose the one you are contributing to: