Collection of graph algorithms and visualizations

You can set the number of vertices you want your graph to have (in the code), and:

• Press E to add a random edge
• Press Space to randomize the position of the vertices (currently uses Poisson Disk Sampling)
• Press B (for "BFS") to find and highlight the connected components of the graph
• Press R to generate a random graph, where each edge is present with some probability p
• Press S to perform a graph search. You can choose which kind of search to perform by passing different push and pop functions to the graph search function. Will eventually support heuristics (it's a minor change, but I can't be bothered right now)

• Add better rules for visualization, e.g. minimum distance between the vertices (done!!), don't let the distance between each edge $(v, w)$ and the vertices in $V \setminus \{v, w\}$ go below a certain distance
• Visualize the presence of cycles
• Coloring algorithms?
• Planarity testing?
• Visualization of quotient graphs?

(Three connected components, colored to reflect their order (bluish if closer to 1, reddish if closer to $|V|$)) and their index (the green component), in order to make it easier to distinguish them)