Rdxfbgrtj

A directed graph with three vertices (blue circles) and three edges (black arrows).

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

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.).

Operations

The basic operations provided by a graph data structure G usually include:^[1]

• 
  adjacent(G, x, y): tests whether there is an edge from the vertex x to the vertex y;


• 
  neighbors(G, x): lists all vertices y such that there is an edge from the vertex x to the vertex y;


• 
  add_vertex(G, x): adds the vertex x, if it is not there;


• 
  remove_vertex(G, x): removes the vertex x, if it is there;


• 
  add_edge(G, x, y): adds the edge from the vertex x to the vertex y, if it is not there;


• 
  remove_edge(G, x, y): removes the edge from the vertex x to the vertex y, if it is there;


• 
  get_vertex_value(G, x): returns the value associated with the vertex x;


• 
  set_vertex_value(G, x, v): sets the value associated with the vertex x to v.

Structures that associate values to the edges usually also provide:^[1]

• 
  get_edge_value(G, x, y): returns the value associated with the edge (x, y);


• 
  set_edge_value(G, x, y, v): sets the value associated with the edge (x, y) to v.

Representations

Different data structures for the representation of graphs are used in practice:

Adjacency list^[2]

Vertices are stored as records or objects, and every vertex stores a list of adjacent vertices. This data structure allows the storage of additional data on the vertices. Additional data can be stored if edges are also stored as objects, in which case each vertex stores its incident edges and each edge stores its incident vertices.

Adjacency matrix^[3]

A two-dimensional matrix, in which the rows represent source vertices and columns represent destination vertices. Data on edges and vertices must be stored externally. Only the cost for one edge can be stored between each pair of vertices.

Incidence matrix^[4]

A two-dimensional Boolean matrix, in which the rows represent the vertices and columns represent the edges. The entries indicate whether the vertex at a row is incident to the edge at a column.

The following table gives the time complexity cost of performing various operations on graphs, for each of these representations, with |V | the number of vertices and |E | the number of edges.^{[citation needed]} In the matrix representations, the entries encode the cost of following an edge. The cost of edges that are not present are assumed to be ∞.

	Adjacency list	Adjacency matrix	Incidence matrix
Store graph	O(|V|+|E|){displaystyle O(|V|+|E|)}	O(|V|2){displaystyle O(|V|^{2})}	O(|V|⋅|E|){displaystyle O(|V|cdot |E|)}
Add vertex	O(1){displaystyle O(1)}	O(|V|2){displaystyle O(|V|^{2})}	O(|V|⋅|E|){displaystyle O(|V|cdot |E|)}
Add edge	O(1){displaystyle O(1)}	O(1){displaystyle O(1)}	O(|V|⋅|E|){displaystyle O(|V|cdot |E|)}
Remove vertex	O(|E|){displaystyle O(|E|)}	O(|V|2){displaystyle O(|V|^{2})}	O(|V|⋅|E|){displaystyle O(|V|cdot |E|)}
Remove edge	O(|V|){displaystyle O(|V|)}	O(1){displaystyle O(1)}	O(|V|⋅|E|){displaystyle O(|V|cdot |E|)}
Are vertices x and y adjacent (assuming that their storage positions are known)?	O(|V|){displaystyle O(|V|)}	O(1){displaystyle O(1)}	O(|E|){displaystyle O(|E|)}
Remarks	Slow to remove vertices and edges, because it needs to find all vertices or edges	Slow to add or remove vertices, because matrix must be resized/copied	Slow to add or remove vertices and edges, because matrix must be resized/copied

Adjacency lists are generally preferred because they efficiently represent sparse graphs. An adjacency matrix is preferred if the graph is dense, that is the number of edges |E | is close to the number of vertices squared, |V |², or if one must be able to quickly look up if there is an edge connecting two vertices.^[5][6]

See also

• 
  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

References

External links

• 
  Boost Graph Library: a powerful C++ graph library s.a. Boost (C++ libraries)
  


• Networkx: a Python graph library


• 
  GraphMatcher a java program to align directed/undirected graphs.