A structure of vertices connected by edges, used to represent pairwise relationships such as roads between cities, links between web pages or dependencies between tasks; the subject of graph algorithms such as search, shortest path and spanning tree.
Facts
Core PrincipleA set of items connected by edges. Each item is called a vertex or node. Formally, a graph is a set of vertices and a binary relation between vertices, adjacency. 2 Connections
Sources
1. Graph theory, Wikipedia
History sectionQuote, History section
In 1736, Leonhard Euler published a paper titled Solutio Problematis ad Geometriam Situs Pertinentis on the Seven Bridges of Konigsberg, which is regarded as the first paper in the history of graph theory.
2. graph (data structure), Dictionary of Algorithms and Data Structures, NIST
DefinitionQuote, Definition
A set of items connected by edges. Each item is called a vertex or node. Formally, a graph is a set of vertices and a binary relation between vertices, adjacency.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.