Graph Theory outline

Source: Internet
Author: User

I have always been biased towards Graph Theory in the team. I 'd like to outline the Learning Outline and complete it when I have time.

 

1. Basic concepts of Graphs

2. Storage Structure

2.1. Adjacent matrix

2.2. Adjacent linked list

2.3. Forward star

3. Shortest Path

3.1. Prerequisites

3.1.1. Dynamic Planning

Used to understand triangular inequalities and relaxation operations

3.1.2. Graph Traversal

3.1.2.1. Directed Graph and undirected graph

3.1.2.2. DFS

3.1.2.3. BFS

3.2. Single-source shortest path algorithm

3.2.1. Dijkstra Algorithm

3.2.1.1. Greedy Thoughts

3.2.1.2. Heap Optimization

3.2.2. Bellman-Ford Algorithm

3.2.3. spfa Algorithm

3.2.3.1. spfa and forward star greedy Optimization

3.2.3.2. The spfa structure applies to various BFS optimizations.

3.2.4. Differential constraint system

3.2.5. Secondary short circuit and K Short Circuit

3.3. Multi-Source Shortest Path

3.3.1. Single-source shortest path algorithm implementation

3.3.2. Full Source Shortest Path

3.3.2.1. folyed-warshall Algorithm

3.3.2.2. Evaluate the minimum ring with floyed

4. topological sorting

4.1. General topological sorting

4.2. DFS Timestamp

5. Tree in Graph Theory

5.1. tree traversal

5.2. Minimum Tree Structure

5.3. Minimum Spanning Tree (MST)

5.3.1. prim algorithm

5.3.2. Kruskal Algorithm

5.3.2.1. Check the set

5.3.3. Secondary minor Spanning Tree and K minor Spanning Tree

5.4. Generate tree count

5.5. Tree Diameter and center of gravity

5.6. Recent public ancestor (LCA)

5.7. Tree grouping Algorithm

5.8. Dynamic Tree (LCT)

6. Graph Decomposition

6.1. Connectivity

6.1.1. strongly connected components of a Directed Graph

6.1.1.1. kosaraju Algorithm

6.1.2. Dual-Unicom Branch

6.2. cut points and bridges

7. network stream

7.1. Maximum stream

7.1.1. Maximum Flow least cut Theorem

7.1.2. zengguang Road

7.1.3. Fee Flow

7.2. Maximum binary matching

7.2.1. Hungarian algorithm

7.3. Maximum density subgraph

8. Other Special graph Problems

8.1. Euler Loop

 

------------------------- Gorgeous split line -------------------------

 

After writing this article... it will be a long article at the top...

 

 

  

Graph Theory outline

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.