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.

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

Jump to bottom

Floyd Warshall Algorithm #2095

Open
muskandn opened this issue Oct 3, 2023 · 2 comments
Open

Floyd Warshall Algorithm #2095

muskandn opened this issue Oct 3, 2023 · 2 comments

Comments

@muskandn
Copy link

muskandn commented Oct 3, 2023

Floyd Warshall Algorithm

Problem Statement: The problem is to find the shortest distances between every pair of vertices in a given edge-weighted directed graph. The graph is represented as an adjacency matrix of size n*n. Matrix[i][j] denotes the weight of the edge from i to j. If Matrix[i][j]=-1, it means there is no edge from i to j.
@muskandn
Copy link
Author

muskandn commented Oct 3, 2023 •
edited

@shivaylamba please assign this issue to me under Hacktoberfest 2023

@puran2003gupta
Copy link

Hello can you assign this to me

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@muskandn @puran2003gupta