Graph (abstract data type)

In computer science, a graph is an abstract data type that is meant to implement the undirected graph and directed graph concepts from mathematics.

Description

A graph data structure consists of a finite (and possibly mutable) set of vertices or nodes or points, together with a set of unordered pairs of these vertices for an undirected graph or a set of ordered pairs for a directed graph. These pairs are known as edges, arcs, or lines for an undirected graph and as arrows, directed edges, directed arcs, or directed lines for a directed graph. The vertices may be part of the graph structure, or may be external entities represented by integer indices or references.

A graph data structure may also associate to each edge some edge value, such as a symbolic label or a numeric attribute (cost, capacity, length, etc.).

See also

• Graph (mathematics)
• Graph traversal for graph walking strategies
• Graph database for graph (data structure) persistency
• Graph rewriting for rule based transformations of graphs (graph data structures)
• Graph drawing software for software, systems, and providers of systems for drawing graphs

External links

• Graph (abstract data type) @ Wikipedia