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

Added a conditional check for unreachable vertices #3153

Closed
wants to merge 2 commits into from
Closed

Added a conditional check for unreachable vertices #3153

wants to merge 2 commits into from

Conversation

simran0963
Copy link

Problem

  • Problem with the infinity vertices in dijkstra's

Solution

  • Added a conditional check for unreachable vertices

Changes proposed in this Pull Request :

  • 1.
  • . for vertex, distance in shortest_distances.items(): if distance == float('infinity'): print(f'Shortest distance from {start_vertex} to {vertex} is unreachable') else: print(f'Shortest distance from {start_vertex} to {vertex} is {distance}') .

@simran0963 simran0963 closed this by deleting the head repository Oct 11, 2024
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