Figure algorithm ---

First, the basics of map

1. FIG communication and non-communication with FIG.

　　FIG communication (Connected Graphs) means between any two nodes within the FIG., One can always find a path connecting them , otherwise non-communicating FIG (Disconnected Graphs). That is, if the graph contains islands (Island), the non-communicating FIG. If the nodes are communicating island, the islands will be as a component (Component, sometimes called Cluster).

　　Some graph algorithm may produce unforeseen errors on the unconnected graph. If we find that the unforeseen result, the structure can first check whether the connectivity map.

 

Second, graph algorithms

• Path Search Algorithm
  • DFS & BFS
  • Shortest Path
  • Minimum spanning tree
  • Random Walk
• Center algorithms
  • Degree Centrality
  • Closeness Centrality
  • Betweenness Centrality
  • PageRank
• Community discovery algorithm
  • Measuring Algorithm
  • Components Algorithm
  • Label Propagation Algorithm
  • Louvain Modularity Algorithm

1. Path Search Algorithm

(1) BFS and DFS

 

（2）path

(3) Random Walk

 

 

 

 

 

references:

[1] graph algorithms: scientific data line DSFrontier

【2】https://www.oreilly.com/library/view/graph-algorithms/9781492047674/