Write a Java program to implement Depth First Search traversal for the following Graph.

b3

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

Note: java

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.

1. BFS (Breadth First Search) and DFS (Depth First Search) algorithms on graphs. a. Represent the following graph in computer. D b. Implement BFS in Java and calculate the BFS result on the above graph using your code. The source (or starting point) is A. c. Implement DFS in Java and calculate the DFS result on the above graph using your code. The source (or starting point) is A. d. What is the time complexity of your BFS algorithm and why? What is the time complexity of your DFS algorithm and why?

Please help with this Java program, and include explanations and comments

Write a java program that takes a matrix representing an undirected graph (connectivity matrix) and finds the minimum spanning tree (using kruskal's or prim's algo.) of that graph and then print it graphically ( Graphical user interface should be used)