The 5 Graph Algorithms that you should know

• Connected Components
• Shortest Path (Dijkstra)
• Minimum Spanning Tree
• Pagerank
• Centrality Measures

• Graph Coloring Methods - a special case of graph labeling; it is an assignment of labels traditionally called “colors” to elements of a graph subject to certain constraints.

• Computation graphs and graph computation / HN
• Le GRAPHE de KLOTSKI - certain games are hard, and is demonstrated as a clustering of various states that are only linked to the winning state by a very small number of edges. So a player can easily “get lost” in the maze.
  • What Is Complexity in Chess?

# See also

• The Boost Graph Library (BGL)
  • Parallel Boost Graph Library
• Handbook of Graph Drawing and Visualization