Algorithms on Graphs
In this chapter we treat efficient algorithms for many basic problems on graphs: topological sorting and transitive closure, connectivity and biconnectivity, least cost paths, least cost spanning trees, network flow problems and matching problems and planarity testing.
KeywordsPlanar Graph Transitive Closure Cost Path Tree Edge Adjacency List
Unable to display preview. Download preview PDF.