ASAP PLS. I just have 1 hour. Data Structure Question. 2 Upvote Guaranteed..

MAIN:

class Main { public static void main(String args[]) { // A graph Graph g1=new Graph(6); g1.addEdge(0, 1); g1.addEdge(0, 5); g1.addEdge(2, 1); g1.addEdge(5, 4); g1.addEdge(4, 2); g1.addEdge(4, 3); // A graph that contains a cycle Graph g2=new Graph(6); g2.addEdge(0, 1); g2.addEdge(1, 5); g2.addEdge(2, 1); g2.addEdge(4, 2); g2.addEdge(4, 3); g2.addEdge(5, 4); // Question 4: Comment here } } 

GRAPH:

// A Java program to print topological sorting of a graph using indegrees // src: https://www.geeksforgeeks.org/topological-sorting-indegree-based-solution/ import java.util.*; //Class to represent a graph class Graph { int V;// No. of vertices //An Array of List which contains //references to the Adjacency List of //each vertex List adj[]; public Graph(int V)// Constructor { this.V = V; adj = new ArrayList[V]; for(int i = 0; i