Skip to content

Add FloydWarshall graph algo. #293

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

Closed

Conversation

italo-batista
Copy link

No description provided.

@italo-batista italo-batista mentioned this pull request Oct 31, 2017
Copy link

@christianbender christianbender left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Good Work! I have some requests


for (int i=0; i < n_vertices ; i++) {
for (int j=0; j < n_vertices; j++) {
if (matrix[i][j] == INF)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please use curly braces. see

int [][] dp_distances = new int[n_vertices][n_vertices];

// Copy graph
for (int i = 0; i < n_vertices; i++)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Use curly braces. see

for (int i = 0; i < n_vertices; i++)
dp_distances[i] = graph[i].clone();

for (int k=0; k < n_vertices ; k++)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Use curly braces. see

}

public static void main(String args[]) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Put in some comments in your code.

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

Successfully merging this pull request may close these issues.

2 participants