ABSTRACT
This section extends the basic terminology and properties begun in Chapter 1, and it describes several classical digraph models that preview later sections of the Handbook. Many of the basic methods and algorithms for digraphs closely resemble their counterparts for undirected graphs. Some general references for digraphs are [ChLeZh10], [GrYe06], and [We01]. A comprehensive and in-depth reference for digraphs is [BaGu01].
terminology note: The term arc is used throughout this section instead of its synonym directed edge.
