Finds shortest routes on unweighted graph
Different levels: what algorithm does, what is main logic, how to code everything
Pseudocode vs C# implementation
Finds shortest routes on weighted graph
Loops over all edges as many times there is vertexes (-1).
Every time measures if distance is shorter than previous time
I have not read yet
We can try to get some ideas together
Write to Chat if you have ideas