Graph representation 網路前瞻技術實驗室图網路前瞻技術實驗室.pptVIP

6.1.3 Graph representation 常見的表示法 Adjacency matrices Adjacency lists Adjacency multilists Adjacency matrix n*n 陣列 n*(n-1),即 O(n2) If the matrix is sparse ? 大部分元素是0 e (n2/2) Adjacency lists n個linked list Adjacency lists, by array Adjacency multilists Weighted edges Cost Weight field Network 6.2 Elementary graph operations Outlines Operations similar to tree traversals Depth-First Search (DFS) Breadth-First Search (BFS) Is it a connected graph? Spanning trees Biconnected components Depth-First Search Adjacency list: O(e) Adjacency Mtx: O(n2) 例如:老鼠走迷宮 Breadth-First Search Connected componen