The algorithm is correct and well implemented; however, it should also check if the weights are non-negative since Dijkstra works only for directed graphs with non-negative weights.
The documentation looks good as well; however, it also needs to specify the non-negative weights detail.
For the missing visualization, it's by far the main purpose of this project and should allow the visualization of the algorithm execution step by step, which may interfere with the actual code of the Dijkstra function.
The algorithm is correct and well implemented; however, it should also check if the weights are non-negative since Dijkstra works only for directed graphs with non-negative weights.
The documentation looks good as well; however, it also needs to specify the non-negative weights detail.
For the missing visualization, it's by far the main purpose of this project and should allow the visualization of the algorithm execution step by step, which may interfere with the actual code of the Dijkstra function.