Q2.Write a Java program to implement Topological sorting for the given Directed acyclic graph. 2 5 3

Write a java program class for a singly linked list with Insertion from head, tail and middle

unique please Your task for this assignment is to identify a spanning tree in one connected undirected weighted graph using C++. Implement a spanning tree algorithm using C++. A spanning tree is a subset of the edges of a connected undirected weighted graph that connects all the vertices together, without any cycles. The program is interactive. Graph edges with respective weights (i.e., v1 v2 w) are entered at the command line and results are displayed on the console. Each input transaction represents an undirected edge of a connected weighted graph. The edge consists of two unequal non-negative integers in the range 0 to 9 representing graph vertices that the edge connects. Each edge has an assigned weight. The edge weight is a positive integer in the range 1 to 99. The three integers on each input transaction are separated by space. An input transaction containing the string “end-of-file” signals the end of the graph edge input. After the edge information is read, the process…

Note: java

Java programming.

Please help with the program below. Need to write a program called dfs-stack.py in python that uses the algorithm below without an agency list but instead uses an adjacency matrix. The program should prompt the user for the number of vertices V, in the graph.Please read the directions below I will post a picture of the instructions and the algorithm.

in java replit code please

Java Very important: As a COMMENT IN CODE, please DO Test-Cases on how you would test your solution assumptions and hence your code explore a specific way to perform a Breadth First Search (BFS) of a given Graph [Ref : Figure 1].