GraphTraversal分解.pptx

Graph Traversal;Contents;Flavors of Graphs;Graphs;Real Life Examples;Flavor of Graphs;Directed vs. Undirected Graphs;有向图;Weighted vs. Unweighted Graphs;带权图;Simple vs. Non-simple Graphs;Sparse vs. Dense Graphs;稀疏图和稠密图;Cyclic vs. Acyclic Graphs;Implicit vs. Explicit Graphs;Isomorphism Graphs;The Friendship Graph;If I am your friend, does that mean you are my friend?;Am I my own friend?;Am I linked by some chain of friends to the President?;路径和圈;How close is my link to the President?;Is there a path of friends between any two people?;连通性;Who has the most friends?;生成树;完全图和补图;术语示意;二分图;相交图、区间图;Data Structures for graph ;Data Structures for Graphs;Adjacency Matrix Representation;Adjacency Matrix Representation;Adjacency Matrix Representation;相关问题;Adjacency Lists Representation;Adjacency Lists Representation;Adjacency Lists Representation;Adjacency Lists Representation;相关问题;;Tradeoffs Between Adjacency Lists and Adjacency Matrices;Question – Adjacency Matrix or List?;前向星表示;Think About;Graph traversal basic;Traversing a Graph;Marking Vertices;Marking Vertices;Marking Vertices;To Do List;Breadth-First Search;BFS基本算法;BFS(G, s) 1 for each vertex u ∈ V [G] - {s} 2 do color[u] ← WHITE 3 d[u] ← ∞ 4 p[u] ← NIL 5 color[s] ← GRAY 6 d[s] ← 0 7 p[s] ← NIL 8 Q ← ? 9 ENQUEUE(Q, s) 10 while Q ≠ ? 11 do u ← DEQUEUE(Q) 12 for each v ∈ Adj[u] 13 do if color[v] = WHITE 14 then color[v] ← GRAY 15 d[v] ← d[u] + 1 16 p[v] ← u 17 ENQUEUE(Q, v) 18 color[u] ← BLACK ;;void bfs(int s) { queueint c; color[s] = 1; dist[s] = 0; parent[s] = -1; c.push(s); while(!c.empty()){ u = c.front(); c.pop(); /* do sth when vertex discovered */ printf(%d ,u); for(int i=0;igraph[u].size();i++) { v = graph[u][i]; if (color[v]==0) { color[v]=1; parent[v] = u; dist[v] = dist[u] + 1; c.push(v);