BFT and BFS
First, Copy and Paste the whole implemented class Graph to the Editor, and save it somewhere outside for safety.
BFS and BFT do the same action, too, but in bfs() we search until end vertex is found. Actually, we can pass unnecessary end node to the bft() and change algorithm a bit, but avoid using to almost the same functions bfs() and bft().
Uppgift
Swipe to start coding
Change the bft() function by adding an unnecessary vertex end as a parameter, so you could refactor it like the bfs() function.
Byt till skrivbordet för praktisk övningFortsätt där du är med ett av alternativen nedanVar allt tydligt?
Tack för dina kommentarer!
