Computer Science

Data Organization

With the invention of the Internet, computer science and graph theory became very closely tied. One of the most useful applications of graph theory in computer science is the ability to use tress to represent the connectivity of the web or any network, and the organization of data

(Ray, 2012)

. Organizing computer memory is especially important, not only to a developer but also to a user. The flow of information through a system are often used as tree diagrams because it is easier to sift through the levels of a tree than to sift through and understand how other types of graphs works. Here is an example of a data organization tree with the PASCAL operating system

(Wilson & Watkins, 1990)

Algorithms

Have you ever used Google Maps to find the fastest and shortest route to your destination?
The algorithm that generates the path comes from the marriage of computer science and graph theory. A huge part of computer science is the use of efficient algorithms, graph theory can help computer scientists achieve that. Most of these algorithms are focused on shortest paths and minimal spanning trees

(Ray, 2012)

. In graph theory, the shortest path algorithm is called Dijkstra's algorithm. Some of its applications are:

Applied to automatically find directions between physical locations (this is where Google Maps comes in to play)
Solve minimal delays (used in networking and telecommunications)
Facility and plant layout (landscaping and architecture)
Robotics
Transportation

Click on the link below to go to the applet and explore Dijkstra's Algorithm.

Dijkstra's Algorithm Applet

What did you learn from playing with this applet?