The above is the current textbook, all of the contents of the figure. After writing, it is ignorant, I don't know what to use after learning ... Just like I am writing, the application is too broad, so I think that the picture "There is nothing" - very strange logic, only carefully The smell can be aware of the helplessness of the written book.
Unlike the front linked list and trees, in the figure, the storage method is not a focus, and we have more attention to the algorithm. When I was writing the program, I did nothing to do with the algorithm and storage method. However, the algorithm is actually an abstraction of the real problem. If our common sense is not good, we have no way to introduce the algorithm. In turn, we will not be interested in its algorithm.
Therefore, in the algorithm of the map, the minimum spanning tree is taken from the laying pipe, which is increasing communication, the traffic network reliability leads out the joint point and the re-connect component, which leads to the shortest path by the map finding, and the key path is taken from the engineering budget. . These probably we can understand all, if there is another electrical network calculation, it is impossible to finish physical knowledge.
But even if the above algorithms are still far from us, most of us may never know how the pipeline is. I think, in addition to the shortest path can cause most people's interest, others can only take a look at the horse. This also makes the picture learning very much like "the ears of the deaf", there are not many people who don't touch the picture, and even if used to the map, it is just an algorithm.
Just like the pathology of data structure teaching, learning is nothing to use often leads to learning, no, the front of the list, the tree can still do something, to the picture, in addition to being a tour guide system, we can't do anything else what. It is very helpless to write here, but I can only be helpless ...
So, I have finished learning, what should we master? Is it the algorithm above the zero? My opinion is, not. I think we should know how the algorithms are "created". If you encounter similar problems, you can "derive" new algorithms. Therefore, I think "Data Structure Algorithm and Application - C Language Description" This book will put the minimum spanning tree, the shortest path, and the topology algorithm to the greedy algorithm, is a more reasonable arrangement.
Finally, I have a deep sympathy of people like me like me when I learned.
