-
-
Notifications
You must be signed in to change notification settings - Fork 46.6k
Feature/dijkstra algorithm tests #9967
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
Feature/dijkstra algorithm tests #9967
Conversation
def print_dist(dist, v): | ||
""" | ||
Print vertex distances. | ||
|
||
Parameters: | ||
dist (list): A list of distances. | ||
v (int): The number of vertices. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Putting the type hints into the function signature allows mypy to check them in our tests. Please do not repeat them in the docstring below because readers will get confused if one is changed but the other is not.
def print_dist(dist, v): | |
""" | |
Print vertex distances. | |
Parameters: | |
dist (list): A list of distances. | |
v (int): The number of vertices. | |
def print_dist(dist: list[float], v: int): | |
""" | |
Print vertex distances. | |
Parameters: | |
dist: A list of distances. | |
v: The number of vertices. |
def min_dist(mdist, vset, v): | ||
""" | ||
Find the vertex with the minimum distance. | ||
|
||
Parameters: | ||
mdist (list): A list of distances. | ||
vset (list): A list of boolean values indicating visited vertices. | ||
v (int): The number of vertices. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
def min_dist(mdist, vset, v): | |
""" | |
Find the vertex with the minimum distance. | |
Parameters: | |
mdist (list): A list of distances. | |
vset (list): A list of boolean values indicating visited vertices. | |
v (int): The number of vertices. | |
def min_dist(mdist: list[float], vset: list[bool], v: int) -> int: | |
""" | |
Find the vertex with the minimum distance. | |
Parameters: | |
mdist: A list of distances. | |
vset: A list of boolean values indicating visited vertices. | |
v: The number of vertices. |
def dijkstra(graph, v, src): | ||
""" | ||
Implement Dijkstra's algorithm to find the shortest path. | ||
|
||
Parameters: | ||
graph (list): The graph represented as an adjacency matrix. | ||
v (int): The number of vertices. | ||
src (int): The source vertex. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
def dijkstra(graph, v, src): | |
""" | |
Implement Dijkstra's algorithm to find the shortest path. | |
Parameters: | |
graph (list): The graph represented as an adjacency matrix. | |
v (int): The number of vertices. | |
src (int): The source vertex. | |
def dijkstra(graph: list[list[float]], v: int, src: int) -> None: | |
""" | |
Implement Dijkstra's algorithm to find the shortest path. | |
Parameters: | |
graph: The graph is represented as an adjacency matrix. | |
v: The number of vertices. | |
src: The source vertex. |
Thank you for your contribution to TheAlgorithms/Python but this has been a very busy HacktoberFest so we will be closing all new pull requests until the end of October so we can properly review approximately 200 open pull requests. We hope you will try to contribute again after October 31st. |
Describe your change:
Fixes issue #9943
Checklist: