Abstract
An application may keep a set of objects and a binary relation between the objects. For example, in order to plan a tour we need the information on a set of cities and the roads between the cities. Another example is a club. We may represent the members of the club and the acquaintance relation between the members in a computer. A set of objects and a binary relation between the objects can be represented with a graph. A graph is a data structure that consists of a set of vertices and a set of edges between the vertices. Vertices can represent cities, club members, or other types of object. Edges represent binary relationships between the objects such as roads between cities or acquaintances between club members.
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
Preview
Unable to display preview. Download preview PDF.
References
E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) pp. 269–271.
S. C. Kleene. Representation of events in nerve nets and finite automata. Automata Studies (1956), Shannon and McCarthy, eds., Princeton University Press, pp. 3–40.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Li, L. (1998). Graphs. In: Java: Data Structures and Programming. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95851-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-95851-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-95853-3
Online ISBN: 978-3-642-95851-9
eBook Packages: Springer Book Archive