a) List all the bridges in this graph. Enter your answers in alphabetical order separated by commas but no spaces. b) If you remove all of the bridges from this graph, how many components will the resulting graph have? x x

Can you give me the java code for the following

9:17 Today Edit 9:17 AM Given a directed graph G=(V, E), design an algorithm to find out whether there is a route between two nodes, say, u and v. Your design should be based on depth first search and should be given in pseudo code.

One can manually count path lengths in a graph using adjacency matrices. Using the simple example below, produces the following adjacency matrix: A B A 1 1 B 1 0 This matrix means that given two vertices A and B in the graph above, there is a connection from A back to itself, and a two-way connection from A to B. To count the number of paths of length one, or direct connections in the graph, all one must do is count the number of 1s in the graph, three in this case, represented in letter notation as AA, AB, and BA. AA means that the connection starts and ends at A, AB means it starts at A and ends at B, and so on. However, counting the number of two-hop paths is a little more involved. The possibilities are AAA, ABA, and BAB, AAB, and BAA, making a total of five 2-hop paths. The 3-hop paths starting from A would be AAAA, AAAB, AABA, ABAA, and ABAB. Starting from B, the 3-hop paths are BAAA, BAAB, and BABA. Altogether, that would be eight 3-hop paths within this graph. Write a program…