DFS: stands for Depth First Search., uses Stack to find the shortest path., is better when target is far from source, It is faster, BFS: stands for Breadth First Search., uses Queue to find the shortest path., is better when target is closer to Source., It is slower,

GRAPH THEORY

列印
嵌入

排行榜

視覺風格

選項

切換範本

恢復自動保存: ?