Dijkstra and DFS. It finds all the shortest ways from one point to all others. Then it counts all the ways which is always coming to the destiny.

深度遍历求图的关节点，手写C。抛砖引玉。 减治法。算法课作业。-DFS GRAPH A point

功能：遍历任意两点之间的所有路径。 设置好起点v和终点end，把它们之间的路径都遍历一次并保存在path中-Features: traverse all paths between any two points. Set a good starting point and end point v end, the path between them are traversed once and saved in the path

深度优先遍历和广度优先遍历算法实现从定点开始的遍历序列。(Depth first traversal and breadth first traversal algorithm to achieve the starting point from the traversal sequence)