X Tutup
The Wayback Machine - https://web.archive.org/web/20201103184624/https://github.com/TheAlgorithms/Java/pull/1267
Skip to content
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.

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

Dijkstra algorithm #1267

Open
wants to merge 2 commits into
base: master
from
Open

Dijkstra algorithm #1267

wants to merge 2 commits into from

Conversation

@da-nish
Copy link

@da-nish da-nish commented Apr 6, 2020

No description provided.

da-nish added 2 commits Apr 6, 2020
Create dijkstra.java
int x=0;
System.out.println();
for (int p: dist ) {
System.out.println(" shortest distance is "+p+" to reach vertex "+(x++));

This comment has been minimized.

@rahilsh

rahilsh Aug 22, 2020

use System.out.printf

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Linked issues

Successfully merging this pull request may close these issues.

None yet

2 participants
You can’t perform that action at this time.
X Tutup