Graph theory Applications in Computer programming - Essay Example

Graph theory Applications in Computer programming Two applications of Graph theory in Computer programming In computing, programs are designed to successfully handle large graphs that are encountered in form of networks such as transportation networks, electrical networks, flow networks, and PERT among others (Kasyanov & Evstigneev, 1994). It is important to understand that manipulating and analyzing graphs and sub-graphs is nonnumeric which means that the programs involve strong ability make decisions.

One application of graph theory in programming is in algorithms. According to Deo (1974, p. 284), Computer algorithms are essential sets of instructions pursued to resolve certain problems. The implication is that every step of an algorithm must be defined unambiguously and precisely such that the algorithm has definiteness, finiteness, output, input and effectiveness. These features of an algorithm are achieved if the computer program is written in a language understandable by the machine or English then converted.

Usually, an algorithm is first expressed in ordinary language, then converted into a flow chart and finally written in a language that the machine can execute. Second application of graph theory in programming is in computation of arithmetic expressions. In computer science, graph theory is a tool used to increase the understanding and solving of numerous mathematical and path problems (Kasyanov & Evstigneev, 1994). Use of computer programming graph theory in computer science In computer programming, Kasyanov & Evstigneev (2000) reveal that algorithms and graph-theoretical methods are applied in order to intuitively present situations defined to be complicated.

The presentation of complex situations through graphs is advantageous given the availability of good visualization tools for graphs. Using graph theory, computer scientists achieve new approaches to problem-solving or at times achieve direct solutions to the problem at hand. Contribution of Graph theory in advancing computer programming knowledge Kasyanov & Evstigneev (1994) highlight that graphs are amongst the structures in computer science that are used to represent a lot of complexity. Today, graph theory has is much applicable in the determination of two isomorphic graphs with much interest in complexity theory.

For most graph problems, the complexity class is absolute for that class (Ray, 2013). With increasing advances in technology, graph theory has numerous applications in programming on day to day life. In networks, graph theory is used especially for security reasons or to schematize topologies in networking. In addition, modern day web development and web design is commonly represented using direct graph. For web sites, the vertices are the web pages that are available at the websites while directed edges between page X and page Y exists only if there is a link between page X and page Y.

Facebook is a good application of graph theory in websites where social media tools like the like button and Facebook search are used. By using Facebook’s search tool, one finds a list of more search options that offer them the opportunity to search for exactly what they want (Ray, 2013). There are also options that allow the user to narrow down their search results based on the number of friends who have liked certain interests, activities, or businesses among others. For Facebook, graph theory plays an important role in target searching and one is presented with endless search possibilities (Ray, 2013).

Today, graph theory is also a major tool in the development of Google map. While using Google maps, the essence is to get a given path calculated. This means that such maps are using an enormous graph with edges and nodes such that it would be easy to get the shortest possible way to travel from one location to the other. In computer programming, the storage of such large amount of data has led to development of impressive speed in calculation and generation of feedback. According to Ray (2013)Neural networks is also another area where graph theory is used through the use of a succession of algorithms that are anticipated at recognizing underlying relationships in a set of data through the use of processes that imitate human brain operation (Ray, 2013).

Conclusion Despite numerous applications of graph theory, this paper has focused on the application of graph theory in computer programming. The two main applications of graph theory discussed in this paper are computation of arithmetic expressions and in algorithms. Through these applications, graph theory in computer science is used not only to solve problems but to also develop and evaluate scenarios that are related to networks. From the discussion, graph theory is applicable both in simple and complex computer programming.

For my programming, I will apply graph theory to represent scenarios that call for fastest computation time even where large amount of data is involved in computations. Like in the case of Google Maps, computation time is really important given that people need the feedback in the shortest time possible (Ray, 2013). In addition, the map also needs to provide people with clues of in the search tools through the use of ranking algorithms such that the search experience is not time consuming but a guided experience (Kasyanov & Evstigneev, 1994).

References Deo, N. (1974). Graph Theory with Applications to Engineering and Computer Science. New Jersey: Prentice Hall, Inc. Kasyanov, V. N. & Evstigneev, V. A. (1994). Graph Theory for Programmers: Algoriths for processing Trees. Netherlands: Kluwer Academic Publishers. Ray, S. S. (2013). Graph Theory with Algorithms and its applications in applied sciences and technology. India: Springer India.