摘要:
深度优先搜索算法和广度优先搜索算法是图论中两个有意思也很实用的算法,下面我们来看看这两个算法。严书中,给出的利用深度优先搜索(Deep First Search)算法进行图的遍历伪码如下 1 Boolean visited[MAX]; //标志数组 2 Status (*VisitFunction... 阅读全文
摘要:
Graphs(review) CLRS, App BDigraph(Directed graph) G = (V, E)·Set V of vertices(singular vertex)·Set E ⊆ V * V of edgesUndirected graph: E contains uno... 阅读全文