Table of Contents
One of the main reasons for LEDA's success is its support of
graphs, by the extremely powerful class
graph on the one hand , by a variety of
built-in graph algorithms on the other hand.
This chapter first gives a short introduction to the basic
concepts from the world of graphs. Then it describes the usage of
graph and how to code, process, and
visualize graphs with this class. A survey of the most important
built-in graph algorithms follows, each beginning with the
description of the underlying problem definition by means of a small
example; this problem then is solved exemplarily with the respective
algorithm. The chapter closes with an example of a self-written
graph algorithm that unites some of the techniques and algorithmic
constituents imparted before.