In: Computer Science
By using javaFX as the GUI, design and implement java based algorithms using appropriate data structures for the following problem:
Use depth-first search to find paths to all the vertices in a graph that are connected to a given start vertex s. A sample input file containing the number of vertices, number of edges and a list of edges called tinyCG.txt is provided for you to test your program.