ABSTRACT
Graphs are used to represent objects and relationships between objects in the real world. There are two kinds of storage methods to store a graph: adjacency list and adjacency matrix.
First, experiments for BFS and DFS were introduced, for many graph algorithms are based on BFS and DFS. Then experiments for some classical graph algorithms, such as the Kruskal algorithm, Prim algorithm, Dijkstra’s algorithm, and SPFA, were introduced. Finally, experiments for algorithms of bipartite graphs and flow networks were given.
