Graph (abstract data type)

Directed

UML graph ADT

Graph (abstract data type) is a fundamental concept in computer science and mathematics, particularly within the fields of data structures, algorithm design, and discrete mathematics. A graph is an abstract data type that is used to represent a set of objects where some pairs of the objects are connected by links. The interconnected objects are represented by mathematical abstractions called vertices (singular: vertex), and the links that connect some pairs of vertices are called edges.

Definition[edit | edit source]

A graph G is defined as an ordered pair of a set V of vertices and a set E of edges, G = (V, E). The edges may be directed or undirected, leading to the distinction between directed graphs (or digraphs) and undirected graphs. In a directed graph, the edges have a direction, from one vertex to another, while in an undirected graph, the edges simply connect the vertices without any direction.

Types of Graphs[edit | edit source]

Graphs can be classified into several types based on their properties:

Undirected graph: A graph in which edges have no direction.
Directed graph (Digraph): A graph where each edge has a direction associated with it.
Weighted graph: A graph in which each edge is assigned a weight or cost.
Unweighted graph: A graph where edges are not assigned any weight.
Simple graph: A graph that does not contain any loops (edges connected at both ends to the same vertex) and where no two vertices are connected by more than one edge.
Multigraph: A graph which may contain multiple edges between the same pair of vertices and loops.
Connected graph: An undirected graph in which there is a path between every pair of vertices.
Disconnected graph: A graph that is not connected, i.e., there are at least two vertices in the graph with no path between them.
Complete graph: A simple undirected graph in which every pair of distinct vertices is connected by a unique edge.

Applications[edit | edit source]

Graphs are used in various applications across many fields due to their versatility in representing complex relationships and structures. Some common applications include:

Network analysis: In computer networks, graphs can represent networks of communication, data organization, computational devices, the flow of computation, etc.
Social network analysis: Graphs are used to represent social networks, where vertices represent individuals or organizations and edges represent the relationships or interactions between them.
Geographical Information Systems (GIS): Graphs can represent various geographical structures, such as roads, paths, and waterways, facilitating the solving of problems related to routing, navigation, and connectivity.
Biology: In bioinformatics, graphs are used to represent biological networks such as genetic, metabolic, or protein-protein interaction networks.

Graph Algorithms[edit | edit source]

Numerous algorithms have been developed for processing graphs, each designed to solve specific problems. Some well-known graph algorithms include:

Graph traversal algorithms, such as Depth-first search (DFS) and Breadth-first search (BFS), for visiting all the vertices of a graph.
Shortest path problem algorithms, like Dijkstra's algorithm, for finding the shortest path between two vertices in a weighted graph.
Minimum spanning tree (MST) algorithms, such as Prim's algorithm and Kruskal's algorithm, for finding a minimum spanning tree of a connected, undirected graph.
Network flow algorithms, like the Ford-Fulkerson algorithm, for computing the maximum network flow in a flow network.

Data Structures for Graphs[edit | edit source]

Graphs can be implemented using various data structures, each with its advantages and disadvantages. The choice of data structure can affect the efficiency of graph algorithms. Common data structures for representing graphs include:

Adjacency list: A list where each vertex has a list of all the vertices it is connected to by an edge.
Adjacency matrix: A matrix used to represent a graph, where the matrix elements indicate whether pairs of vertices are adjacent or not in the graph.
Edge list: A list of edges, where each edge is represented as a pair (or triplet, for weighted graphs) of vertices.

Conclusion[edit | edit source]

Graphs, as an abstract data type, provide a powerful and flexible way to represent and manipulate interconnected data. They form the backbone of many critical algorithms and applications in computer science and beyond.

Graph (abstract data type) Resources
Need Help Finding a Doctor? Need help finding a doctor or specialist anywhere in the world? Explore our world directory. WikiMD's DocFinder can assist you in locating millions of physicians.	Medical Knowledge Access the latest research - Most recent articles Ongoing trials.