Graphs are incredibly helpful in the development world, providing capabilities such as holding the connections in a list and searching through those connections in ways only limited to one's creativity, all while allowing the same capabilities of the list as an Array. I built this application to learn about the graph data structure, and I hope it's as visualizing of graph capabilities as it was for me in building it. It is additionally mobile friendly.
The running application can be found here: https://paulmeddaugh.github.io/Graph-Visualizer/
The Trello board can be found here: https://trello.com/b/0vXmvjiV/graph-visualizer
This application has options to load a map of certain locations in the US or a small binary tree map.
Depth-First - Searches from a point by exploring every connection found attached to one of its 'neighbors,' or points connected, before going on to another.
Breadth-First - Explores all of a starting point's neighbors, or points connected, before searching all the neighbors of those neighbors.
Uses connection 'weights' (i.e. for storing miles)
Minimum Spanning Tree - Determines the least 'weightiest' way to travel to every point in the graph.
Shortest Path - Determines the least 'weightiest' path from one point to another.
Merge Sort - Sorts the points in the graph by either their 'X' or 'Y' co-ordinate through spliting and sorting the list in sub-sections, and merging those sub-sections.
Closest Pair of Points - Finds the closest pair in the graph by determining the closest pair in smaller sections and merging those sub-sections (Divide and Conquer method).