Synonyms
Definition
A digraph D consists of a (finite) set of vertices V (D) and a set A(D) of ordered pairs, called arcs, of distinct vertices. An arc (u, v) has tail u and head v, and it is said to leave u and enter v.
Figure 1 shows a digraph D with vertex set V (D) = {u, v, w, x, y, z} and arc set A(D) = {(u, v), (u, w), (v, w), (w, x), (x, w), (x, z), (y, x), (z, x)}. Digraphs can be viewed as generalizations of graphs.
A digraph
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media New York
About this entry
Cite this entry
(2017). Digraphs. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_215
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7687-1_215
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7685-7
Online ISBN: 978-1-4899-7687-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering