Data Structure Learning (C ++)-graph (Summary)

The above is all the content of the graph in the current textbook. After I finish writing, I am confused. I don't know what to do after I finish learning ...... As I wrote at the beginning, graphs are too widely used and I think they are "useless"-a strange logic, only by carefully understanding can we be aware of the helplessness of those who write textbooks.

Unlike the linked list and tree above, the storage method is not the focus here, And we focus more on algorithms. When I write a program, I try my best to make the algorithm irrelevant to the storage method. However, algorithms are actually the abstraction of real-world problems. If we do not have the same common sense, we will not be able to introduce algorithms. In other words, there will be almost no problems, we will not be interested in its algorithms.

Therefore, in the graph algorithm, the Minimum Spanning Tree is derived from the laying pipeline, and the joint points and reconnection components are derived from improving the communication and traffic network reliability, the shortest path is derived from the map path finding, and the Key Path is derived from the project budget. I am afraid this is all we can understand. If there is another electrical network computing, I am afraid it will be over without any physical knowledge.

Even so, the above algorithms are still far away from us. Most of us may never know how the pipelines are laid. I think, in addition to the shortest path, most people will be interested in it. Others will only be able to take a look. This also makes graph learning much like "deaf ears". There are not many people who really come into contact with graphs, and even if they use graphs, they are just some algorithms.

Just like the common problem of Data Structure teaching, learning to be useless often leads to nothing to learn. The linked list and tree above can also do something. Here, apart from being a tour guide system, we can't do anything else. It is helpless to write here, but I can only be helpless ......

After learning the graph, what should we master? Is it a scattered algorithm? My opinion is, no. I think we should know how these algorithms are created. If we encounter similar problems, can we "derive" new algorithms. Therefore, I think the book "Data Structure Algorithm and Application-C ++ language description" puts the Minimum Spanning Tree, shortest path, and topological sorting algorithm of the graph into the greedy algorithm to explain, it is a more reasonable arrangement.

Finally, I am deeply sympathetic to those who are just as confused as I am when learning graphs.