We have already seen several problems related to graphs. In this chapter we consider in more details two classes of problems: computation of shortest paths (section 9.1) and graph traversal algorithms (section 9.2).
KeywordsShort Path Minimal Cost Outgoing Edge Graph Algorithm Cost Matrix
Unable to display preview. Download preview PDF.