7. Graph Theory

1. Shortest

2. Minimum spanning tree

3. The diameter of the tree with the most recent common ancestor

4. Tree ring

5. Negative differential constraint ring

6. Tarjan algorithm of FIG no communication with the

7. Tarjan algorithm and the communicating of FIG.

8. Matching of bipartite graph

9. Covering the bipartite graph independent set

10. Flow of Network

11. Summary and Practice