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

打印
嵌入

排行榜

视觉风格

选项

切换模板

恢复自动保存：？