Java Program to Implement Tarjan Algorithm

This is a Java Program to Implement Tarjan Algorithm. Tarjan Algorithm is used for finding all strongly connected components in a graph.

Here is the source code of the Java Program to Implement Tarjan Algorithm. The Java program is successfully compiled and run on a Windows system. The program output is also shown below.

/**
 *     Java Program to Implement Tarjan Algorithm
 **/
 
import java.util.*;
 
/** class Tarjan **/
class Tarjan
{
    /** number of vertices **/
    private int V;    
    /** preorder number counter **/
    private int preCount;
    /** low number of v **/
    private int[] low;
    /** to check if v is visited **/
    private boolean[] visited;      
    /** to store given graph **/
    private List<Integer>[] graph;
    /** to store all scc **/
    private List<List<Integer>> sccComp;
    private Stack<Integer> stack;
 
    /** function to get all strongly connected components **/
    public List<List<Integer>> getSCComponents(List<Integer>[] graph) 
    {
        V = graph.length;
        this.graph = graph;
        low = new int[V];
        visited = new boolean[V];
        stack = new Stack<Integer>();
        sccComp = new ArrayList<>();
 
        for (int v = 0; v < V; v++)
              if (!visited[v])
                dfs(v);
 
        return sccComp;
    }
    /** function dfs **/
    public void dfs(int v) 
    {
        low[v] = preCount++;
        visited[v] = true;
        stack.push(v);
        int min = low[v];
        for (int w : graph[v]) 
        {
            if (!visited[w])
                dfs(w);
            if (low[w] < min) 
                min = low[w];
        }
        if (min < low[v]) 
        { 
            low[v] = min; 
            return; 
        }        
        List<Integer> component = new ArrayList<Integer>();
        int w;
        do
        {
            w = stack.pop();
            component.add(w);
            low[w] = V;                
        } while (w != v);
        sccComp.add(component);        
    }    
    /** main **/
    public static void main(String[] args)
    {    
        Scanner scan = new Scanner(System.in);
        System.out.println("Tarjan algorithm Test\n");
        System.out.println("Enter number of Vertices");
        /** number of vertices **/
        int V = scan.nextInt();
 
        /** make graph **/
        List<Integer>[] g = new List[V];        
        for (int i = 0; i < V; i++)
            g[i] = new ArrayList<Integer>();        
        /** accpet all edges **/
        System.out.println("\nEnter number of edges");
        int E = scan.nextInt();
        /** all edges **/
        System.out.println("Enter "+ E +" x, y coordinates");
        for (int i = 0; i < E; i++)
        {
            int x = scan.nextInt();
            int y = scan.nextInt();
            g[x].add(y);
        }
 
        Tarjan t = new Tarjan();        
        System.out.println("\nSCC : ");
        /** print all strongly connected components **/
        List<List<Integer>> scComponents = t.getSCComponents(g);
           System.out.println(scComponents);        
    }    
}
Tarjan algorithm Test
 
Enter number of Vertices
8
 
Enter number of edges
14
Enter 14 x, y coordinates
0 1
1 2
2 3
3 2
3 7
7 3
2 6
7 6
5 6
6 5
1 5
4 5
4 0
1 4
 
SCC :
[[5, 6], [7, 3, 2], [4, 1, 0]]

Related posts:

Service Registration with Eureka
Java Program to Implement PriorityQueue API
Spring Boot - File Handling
Java Program to Represent Graph Using Adjacency List
Java Program to Implement LinkedList API
Guide to System.gc()
Java Program to Find Minimum Element in an Array using Linear Search
Netflix Archaius with Various Database Configurations
Java Program to Remove the Edges in a Given Cyclic Graph such that its Linear Extension can be Found
Converting between an Array and a List in Java
Java Program to Perform Postorder Non-Recursive Traversal of a Given Binary Tree
Introduction to the Java NIO2 File API
Using Spring ResponseEntity to Manipulate the HTTP Response
Java Program to Compute Discrete Fourier Transform Using the Fast Fourier Transform Approach
Java Program to Check whether Undirected Graph is Connected using DFS
Java Program to Perform Polygon Containment Test
A Guide to the finalize Method in Java
Java Program to Implement Circular Doubly Linked List
A Guide to Java HashMap
Guide to @ConfigurationProperties in Spring Boot
TreeSet và sử dụng Comparable, Comparator trong java
Java Program to Implement Double Order Traversal of a Binary Tree
Spring Boot - Logging
Hướng dẫn sử dụng Java Generics
Simultaneous Spring WebClient Calls
Class Loaders in Java
Hướng dẫn Java Design Pattern – Prototype
Java Program to Find Strongly Connected Components in Graphs
Java Program to Implement HashMap API
Thao tác với tập tin và thư mục trong Java
Java – InputStream to Reader
JPA/Hibernate Persistence Context