Skip to content

Update dijkstra.cpp #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
iilyas01 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update dijkstra.cpp #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 25 additions & 2 deletions dijkstra.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -97,7 +97,7 @@ void printDistances(const unordered_map<long long, double>& distance) {
cout << "----------------------------\n";
}

void dijkstra(long long start) {
void dijkstra(long long start, long long destination ) {
unordered_map<long long, double> distance;
unordered_map<long long, long long> previous;
unordered_map<long long, bool> visited;
Expand All @@ -124,6 +124,26 @@ void dijkstra(long long start) {
cout << "Visiting node " << u << " (distance = " << current.dist << ")\n";
printDistances(distance);

if(u == destination) {
cout<<"\ndestination"<<destination<<"reached.\n";
cout<<"\ndistance"<<distance[u]<<endl:
}
vector<long long> path;
for(long long t = destination; t != start; t= previous[t]){
path.push_back(t);
}
path.push_back(start);
reverse(path.begin(), path.end());

cout<<"path";
for(size_t i=0; i<path.size(); i++){
cout<<path[i];
if(i != path.size()-1)
cout<<"->";
}
cout<<endl;
return;

for (auto& neighbor : graph[u]) {
long long v = neighbor.first;
double weight = neighbor.second.second;
Expand Down Expand Up @@ -159,7 +179,10 @@ int main() {
graph[3][5] = {"alley", 10.0};
graph[4][5] = {"path", 2.0};

dijkstra(1);
long long source =1;
long long destination =5;

dijkstra(source, destination);

return 0;
}