There are no reviews yet. Be the first to send feedback to the community and the maintainers!
Repository Details
I created a program that recommended running BFS a week after learning the algorithm, it was very interesting to see it running step by step like a debugger. BFS is an algorithm for finding the shortest path from the top of the source s to any other vertex in a given G graph. The software shows the algorithm running on the left, and the graph on the right side of the top, and the bottom of the algorithm's output on the shortest paths. The project was very challenging visually. And a very impressive result.
