Drag from vertex to vertex to create edge.

New clears an old graph.

DFS carries out Depth First Search.

BFS carries out Breadth First Search.

Tree creates minimum spanning tree.

View toggles between graph and adjacency matrix.