The data structures and traversal algorithms of Chapter 5 provide the basic building blocks for any computation on graphs. However, all the algorithms presented there dealt with unweighted graphs—i.e., graphs where each edge has identical value or weight.
There is an alternate universe of problems for weighted graphs. The edges of road networks are naturally bound to numerical values such as construction cost, traversal time, length, or speed limit. Identifying the shortest path in such graphs proves more complicated than breadth-first search in unweighted graphs, but opens the door to a wide range of applications.
KeywordsShort Path Span Tree Minimum Span Tree Edge Weight Weighted Graph
Unable to display preview. Download preview PDF.
- [CC97]W. Cook and W. Cunningham. Combinatorial Optimization. Wiley, 1997.Google Scholar
- [RS96]H. Rau and S. Skiena. Dialing for documents: an experiment in information theory. Journal of Visual Languages and Computing, pages 79–95, 1996.Google Scholar
- [Wes00]D. West. Introduction to Graph Theory. Prentice-Hall, Englewood Cliffs NJ, second edition, 2000.Google Scholar