Suppose we have a graph with vertices V = A, B, C, D, E and edges E = (A, B, 2), (A, C, 3), (B, D, 1), (C, D, 2), (D, E, 1). The weights of the edges are shown in parentheses. If we want to find the shortest path from vertex A to vertex E, we can apply Dijkstra's algorithm as follows:
Paths, cycles, connectivity
In the vast ecosystem of mathematical textbooks, few subjects intimidate and delight newcomers quite like graph theory. It is the language of networks, the backbone of computer science, and the playground of discrete mathematics. Yet, for every student who falls in love with Kuratowski’s theorem or Dijkstra’s algorithm, dozens give up halfway through dense, theorem-proof-corollary texts. graph theory a problem oriented approach pdf best