Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Detecting A Cycle in Graph

    Uploaded by

    anujguptawork2002
    This Java program detects cycles in a directed graph. It takes a graph as input, represented by its adjacency list, and uses a recursive function to check for cycles by doing a depth first search while also maintaining a recursion stack to check for back edges. The main method creates a sample graph with cycles and without cycles, and uses the isCyclic method to check each graph and print the result.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Detecting A Cycle in Graph

    Uploaded by

    anujguptawork2002
    5 views2 pages
    This Java program detects cycles in a directed graph. It takes a graph as input, represented by its adjacency list, and uses a recursive function to check for cycles by doing a depth first search while also maintaining a recursion stack to check for back edges. The main method creates a sample graph with cycles and without cycles, and uses the isCyclic method to check each graph and print the result.

    Original Description:

    Original Title

    Detecting a Cycle in Graph

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This Java program detects cycles in a directed graph. It takes a graph as input, represented by its adjacency list, and uses a recursive function to check for cycles by doing a depth first search while also maintaining a recursion stack to check for back edges. The main method creates a sample graph with cycles and without cycles, and uses the isCyclic method to check each graph and print the result.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    5 views2 pages

    Detecting A Cycle in Graph

    Uploaded by

    anujguptawork2002
    This Java program detects cycles in a directed graph. It takes a graph as input, represented by its adjacency list, and uses a recursive function to check for cycles by doing a depth first search while also maintaining a recursion stack to check for back edges. The main method creates a sample graph with cycles and without cycles, and uses the isCyclic method to check each graph and print the result.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    Java program to detect a cycle in a directed graph

    Anuj Gupta 20BCE7055

    import java.util.Scanner;
    class Graph {
    static final int V;
    static final List<List<Integer> > adj;

    public Graph(int V)
    {
    this.V = V;
    adj = new ArrayList<>(V);

    for (int i = 0; i < V; i++)


    adj.add(new LinkedList<>());
    }

    private boolean isCyclicUtil(int i, boolean[] visited,


    boolean[] recStack)
    {
    if (recStack[i])
    return true;

    if (visited[i])
    return false;

    visited[i] = true;

    recStack[i] = true;
    List<Integer> children = adj.get(i);

    for (Integer c : children)


    if (isCyclicUtil(c, visited, recStack))
    return true;

    recStack[i] = false;

    return false;
    }

    private void addEdge(int source, int dest)


    {
    adj.get(source).add(dest);
    }
    private boolean isCyclic()
    {
    boolean[] visited = new boolean[V];
    boolean[] recStack = new boolean[V];
    for (int i = 0; i < V; i++)
    if (isCyclicUtil(i, visited, recStack))
    return true;

    return false;
    }
    public static void main(String[] args)
    {
    Graph graph = new Graph(4);
    graph.addEdge(0, 1);
    graph.addEdge(0, 2);
    graph.addEdge(1, 2);
    graph.addEdge(2, 0);
    graph.addEdge(2, 3);
    graph.addEdge(3, 3);

    if (graph.isCyclic())
    System.out.println("Graph contains cycle");
    else
    System.out.println("Graph doesn't "
    + "contain cycle");
    }
    }

    You might also like