<- People Behind Informatics


All 0-9 A B C D E F G H I J K L M N O P Q R S T U V W XY Z




 
Graph Algorithm
Many computational applications naturally involve not just a set of items, but also a set of connections between pairs of those items. To model such situations, abstract objects called graphs are used. A graph is a set of vertices and a set of edges that connect pairs of distinct vertices. Graph theory, a major branch of combinatorial mathematics, has been studied intensively for hundreds of years. Many important and useful properties of graphs have been proved, yet many difficult problems remain unresolved. The algorithmic investigation of graphs is relatively recent. Although a few of the fundamental algorithms are old, the majority of the interesting ones have been discovered within the last few decades. Even the simplest graph algorithms lead to useful computer programs, a fact that is illustrated by Dijkstra`s elegant shortest path algorithm. Depth First Search Breadth First Search [Source: Laszlo Böszörmenyi: Notes to the Virtual Exhibition "People behind Informatics"; Robert Sedgewick, Algorithms in C++, Part 5 Graph Algorithms, Addison-Wesley, 2002]
 

 

<- People Behind Informatics


Home  |  Top  |  Search  |  Gallery  | Glossary  | Sitemap  |  Making Of  |  Help