Introduction to Graph Data Structure - The Coding Shala

Home >> Data Structures >> Introduction to Graph

Introduction to Graph Data Structure

The graph is one of the most important data structures that solve many real-world problems. A graph is a non-linear data structure. A Graph organizes items in an interconnected network. The following is an example of the graph:
Graph - The Coding Shala
A graph G is an ordered pair of a set V of Vertices and a set E of Edges.
                             G = (V,E).

 Ordered pair means: (a,b) not equals to (b,a) if,  a not equals to b.
Unordered pair is: {a,b} = {b,a}

 In the graph, edges can be two types: Directed and Undirected edges.
Directed and Undirected Edges - The Coding Shala
So based on the edges type graph can be two types:
  • A directed graph or Digraph
  • An undirected graph
Directed Graph and Undirected Graph - The Coding Shala


In the directed graph there is a direction from one vertex to another. An example of a Directed graph is the Internet(Web). In Web one page contains a link to another page but the reverse is not necessary. 

In the undirected graph, edges are bidirectional.  An example of an undirected graph is a social network like Facebook. 

Weighted and Unweighted Graph

A graph can be weighted or unweighted. Weighted graph means each edge contains some weight(value). In an unweighted graph, edges do not contain any values they all are having the same weight(1).
Weighted Graph and Unweighted Graph - The Coding Shala

Properties of Graph

The following are some properties of a graph:
Self Loop: An edge from a node to itself.
Self loop Graph - The Coding Shala

Multi-edge: If There is more than one edge between two vertices then its called multi-edges.
Multi Edges Graph - The Coding Shala



If a graph does not contain self-loop and multi-edge called a simple graph.

How to find the number of edges in a simple graph?
In a graph, if the number of vertices is |v| = n
then,  edges are
                0 <= |E| <= n*(n-1) , if graph is directed.
                0 <= |E| <= (n*(n-1))/2  ,if graph is undirected.

Dense Graph: If a graph contains too many edges almost near to the maximum number of edges called a dense graph.

Sparse Graph: If a graph contains few edges almost equal to the number of vertices called sparse graph.

Path: A sequence of vertices where each adjacent pair is connected by an edge is called path is also known as a Walk.
Path in Graph - The Coding Shala

Simple Path: A path in which no vertices and edges are repeated call simple path.

Trail: A Trail is a walk in which no edges are repeated.

Strongly connected graph: In a graph, if there is a path from any vertex to any other vertex then the graph is called a strongly connected graph. If a graph is undirected then we simply called it a connected graph.
Strongly Connected Graph - The Coding Shala

Cyclic or Acyclic Graph: If a graph contains a cycle called Cyclic graph otherwise Acyclic graph.

Graph Coloring: If we assign colors to each node in a graph called graph coloring. A legal coloring is if no adjacent nodes have the same color.

Graph Representations

The most commonly used representation of a graph are:
  • Adjacency Matrix
  • Adjacency List
Let's take an example
Graph Example - The Coding Shala
Adjacency Matrix
We take a 2D array of size V*V, where V is the number of vertices in a graph and array[i][j]=1 indicates that there is an edge. Adjacency Matrix for the above example graph is:
Adjacency Matrix - The Coding Shala

Adjacency List
We used an array of lists. The size of the array is the number of vertices and arr[i] represents the list of vertices adjacent to the ith vertex. The following is the adjacency list representation of the above graph:
Adjacency list Graph - The Coding Shala

Generally, we used the adjacency list for sparse graph and adjacency matrix for dense graphs.

Graph Traversals

There are 2 popular approaches to doing graph traversals is:
  • Depth-First Search(DFS)
  • Breadth-First Search(BFS)
That's it for the introduction of graphs. We will see all the topics in detail in coming posts.



Other Posts You May Like
Please leave a comment below if you like this post or found some error, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Shell Script to Create a Simple Calculator - The Coding Shala

Home >> Scripting >> simple calculator Shell Script to Create a Simple Calculator Write a shell script to create a simple calculator using a switch-case statement? Code:  #! / bin / bash echo "simple calculator" sum = 0 i = "y" echo "enter first number" read n1 echo "enter second number" read n2 while [ $ i = "y" ] do echo "1.Addition" echo "2.Subtraction" echo "3.Multiplication" echo "4.Division" echo "Enter choice" read ch case $ch in 1 ) sum =$(echo " $n1 + $n2" | bc - l) echo "Addition is =" $ sum ;; 2 ) sum =$(echo "$n1 - $n2" | bc - l) echo "Sub is =" $ sum ;; 3 ) sum =$(echo "$n1 * $n2" | bc - l) echo "Mul is =" $ sum ;; 4 ) sum =$(echo "$n1 / $n2" | bc - l) echo "div is =" $ sum ;; * )echo "invalid choice" esac echo "Do y...
Read more

Java Program to Convert Binary to Decimal - The Coding Shala

Home >> Java Programs >> Convert Binary to Decimal  Hey there, welcome back to another post. In this post, we will learn how to convert Binary to Decimal in Java. Java Program to Convert Binary to Decimal You have given a binary number, convert it to a decimal number. Example:  Input: 101 Output: 5 Input: 111 Output: 7 Binary to Decimal Conversion in Java Approach We will the below formula to convert binary to decimal: decimal number = (2^0) * (rightmost digit) + (2^1) * (second rightmost digit) + ...  for example:  binary number = 110 decimal number = 2^0 * 0 + 2^1 * 1 + 2^2 * 1 = 1 * 0 + 2 * 1 + 4 * 1 = 0 + 2 + 4 = 6 Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void printDecimal( int num) { int decimal = 0; int twos = 1; // 2^0 = 1 initial value while (num > 0) { ...
Read more

N-th Tribonacci Number Solution - The Coding Shala

Home >> Programming >> N-th Tribonacci Number  Hey there, welcome back to another post. In this post, we will learn how to solve the N-th Tribonacci Number problem and will implement its solution in Java. N-th Tribonacci Number Problem Statement The Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0. Given n, return the value of Tn.  Example 1:  Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 + 2 = 4 N-th Tribonacci Number Java Solution using Bottom-Up DP This problem is similar to the Fibonacci series. We can solve it using the Bottom-Up approach of dynamic programming. Time Complexity: O(n) Space Complexity: O(n) The space complexity can be reduced to O(1) by using variables to store the previous three values instead of using an array. Java Program:  class Solution { public int tribonacci( int n) { if (n == 0) return 0; ...
Read more

LeetCode - Shuffle the Array Solution - The Coding Shala

Home >> LeetCode >> Shuffle the Array  In this post, we will learn how to solve LeetCode's Shuffle the Array problem and will implement its solution in Java. Shuffle the Array Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn]. Example 1: Input: nums = [2,5,1,3,4,7], n = 3 Output: [2,3,5,4,1,7]  Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7]. Example 2: Input: nums = [1,2,3,4,4,3,2,1], n = 4 Output: [1,4,2,3,3,2,4,1] Practice this problem on LeetCode: Click Here. Shuffle the Array Java Solution Approach 1: Using a new Array. Space complexity: O(n). Java Program:  class Solution { public int [] shuffle ( int [] nums , int n ) { int [] ans = new int [ 2 * n ]; int j = 0 ; for ( int i = 0 ; i < 2 * n ; i = i + 2 ){ ans [ i ] = nums [ j ]; ans...
Read more

Java Program to Find GCD or HCF of Two Numbers - The Coding Shala

Home >> Java Programs >> Find GCD of Two Numbers  Hey there, welcome back to another post. In this post, we will learn how to find GCD or HCF of Two Numbers in Java. Java Program to Find GCD or HCF of Two Numbers The GCD (Greatest Common Divisor) or HCF (Highest Common Factor) of two numbers is the largest number that divides both of them. For example:  Number1: 6 (2 * 3) Number2: 9 (3 * 3) GCD or HCF of 6 and 9 is: 3 Find GCD of Two Numbers in Java using for Loop As we already know, GCD is the largest number that divides both numbers. We can start a for loop from 1 (because 1 divides all the numbers) to both numbers and if it divides both numbers then update GCD. Java Program:  import java.util.Scanner; /** * https://www.thecodingshala.com/ */ public class Main { public static void findGCD( int num1, int num2) { int gcd = 1; if (num1 == 0) { gcd = num2; } if (num2 == 0) { ...
Read more