Why are putting some numbers in the box and saying that they are the less weighted routes to this or that vertice, while you haven't finished the whole algorithm? Maybe when you will be considering next vertices you will find even more less weighted route to this or that vertice?
How we can go from the E to B ?? I didnt get it like if u want to go from A to F we should follow this order : A-C-D-E-G-F not like the video A-C-D-E-B-G-F
There is no direct connection from E to B, and the best path you mention for A to F is the one I detailed in the process of the video. The shortest path is of length 8, and it is ACDEGF.. The way to see the paths is explained near the end of the video; watch again. I never said there was a connection from E to B.
Not leting comment here about how the vídeo was so well explained would be a mistake and the ugliet things i've never done in my life, thanks. From Mozambique (África).
