Cloud Computing(7)_Graph Algorithms

Graph problems and representations

• Some graph problems
  
  • Graph search and path planning
  • Graph clustering
  • Minimum spanning tree
  • Bipartite graph matching
  • Maximum flow
  • Identifying “special” nodes
• Graph Representations
  
  • Adjacency matrix
    
    • 
    • Advantages:
      
      • 矩阵的操作很方便
      • 行代表outlinks，列代表inlinks
    • Disadvantages:
      
      • 稀疏矩阵，浪费空间
  • Adjacency list（将矩阵中的0 抛弃）
    
    • 
    • Advantages:
      
      • outlinks很方便
    • Disadvantages:
      
      • inlinks很难得到

Parallel breadth-first search

PageRank

Beyond PageRank and other graph algorithms

Optimizing graph algorithms

（嗨呀….期末考猛如虎，以后有空再补T_T）