A graph is a fundamental data structure in computer science and mathematics that consists of a collection of nodes (also known as vertices) and edges. It is used to represent and model relationships between different entities. In a graph, nodes can represent various entities, and edges define connections or interactions between these entities. The relationships between nodes can be diverse, ranging from social connections in a social network to dependencies between tasks in a project.


Formally, a graph G is defined as an ordered pair G=(V,E), where:

  1. V is a set of nodes or vertices, each representing an entity or element.
  2. E is a set of edges, which are pairs of nodes that establish connections between vertices. An edge can be represented as e=(v1​,v2​), where v1​ and v2​ are nodes connected by the edge.

Basic terminology

  1. Nodes (Vertices): These are the fundamental elements of a graph, representing entities. Nodes can store data or other attributes, depending on the application.
  2. Edges: Edges connect pairs of nodes and represent relationships between them. An edge may be directed (pointing from one node to another) or undirected (bidirectional).
  3. Degree: The degree of a node in an undirected graph is the number of edges connected to it. In a directed graph, the in-degree is the number of edges pointing into the node, and the out-degree is the number of edges pointing out of the node.
  4. Weighted Edges: Some graphs have weighted edges, where each edge is assigned a numerical value (weight) that represents a certain metric, such as distance, cost, or strength of connection.
  5. Directed vs. Undirected Graphs: In directed graphs (also called digraphs), edges have a direction, indicating a one-way relationship. In undirected graphs, edges have no direction and represent a mutual relationship.
  6. Cycles: A cycle is a path that starts and ends at the same node, passing through a sequence of nodes and edges. Cycles can be important in analyzing the connectivity and structure of a graph.
  7. Acyclic Graphs: Graphs that do not contain any cycles are called acyclic graphs. These graphs are crucial in various applications, such as representing dependencies or hierarchies.
  8. Connectedness: In an undirected graph, a path exists between any two nodes. If a directed graph has a path from every node to every other node, it’s called a strongly connected graph.
  9. Paths: A path in a graph is a sequence of nodes connected by edges. The length of a path is determined by the number of edges it contains.
  10. Shortest Path: Finding the shortest path between two nodes is a common problem in graph algorithms. Algorithms like Dijkstra’s algorithm and the Bellman-Ford algorithm are used to find the shortest path based on edge weights.
  11. Graph Traversal: Graph traversal involves visiting all nodes in a graph systematically. Depth-First Search (DFS) and Breadth-First Search (BFS) are two common traversal algorithms.
  12. Graph Representations: Graphs can be represented using various data structures, including adjacency matrices and adjacency lists. The choice of representation depends on the graph’s density and the types of operations required.
  13. Graph Algorithms: Numerous graph algorithms solve problems like finding spanning trees, detecting cycles, finding strongly connected components, and more. Some important algorithms include Kruskal’s algorithm, Prim’s algorithm, and Tarjan’s algorithm.

Example of graph:

   |   |
   C   D
    \ /

In this graph:

  • Node ‘A’ is connected to nodes ‘B’ and ‘C’.
  • Node ‘B’ is connected to nodes ‘A’ and ‘D’.
  • Node ‘C’ is connected to nodes ‘A’ and ‘E’.
  • Node ‘D’ is connected to node ‘B’.
  • Node ‘E’ is connected to node ‘C’.

Application of Graph data structure

  1. Computer Networking and Routing Algorithms: Graphs are used to model computer networks, where nodes represent routers or computers and edges represent connections. Routing algorithms, like Dijkstra’s and Bellman-Ford, utilize graph theory to find the shortest path for data packets to travel efficiently.
  2. Social Networks and Recommender Systems: Social media platforms use graphs to model relationships between users. Graph algorithms can be applied to suggest friends, connections, or content that a user might be interested in, based on their connections and interests.
  3. Transportation and Logistics: Graphs are used to model transportation networks, such as road networks, subway systems, and flight routes. Algorithms like the Traveling Salesman Problem and Maximum Flow are used to optimize transportation routes and resource allocation.
  4. Bioinformatics and Molecular Biology: Graphs are used to represent biological data such as protein-protein interaction networks, genetic regulatory networks, and DNA sequences. Graph algorithms help analyze and predict biological interactions and structures.
  5. Web Page Ranking and Search Engines: Algorithms like PageRank, used by Google, employ graph theory to rank web pages based on their importance and relevance. These algorithms consider the linking structure between web pages.
  6. Optimization Problems: Graph algorithms are employed in solving various optimization problems, such as finding the shortest path, minimum spanning tree, maximum flow, and assignment problems.
  7. Cybersecurity: Graphs are used to model networks for anomaly detection, identifying suspicious patterns, and tracing connections in cyber threats and attacks.

more related content on Data Structure and Algorithms(DSA)

And get notified everytime we publish a new blog post.