This preview shows page 1. Sign up to view the full content.
Unformatted text preview: vertex in a graph to every other vertex in weighted graph. These were described in Section 10.4. The FloydWarshall algorithm (discussed in the same section) computes the shortest distances between every pair of vertices in a (weighted) graph. In Section 11.2, we discussed the BellmanFord algorithm which finds the shortest path from a specified vertex to every other vertex in a weighted digraph devoid of negative weight cycles. In this section, we learned about Bellman's algorithm, which determines the shortest distance from a specified vertex in an acyclic digraph to every other vertex. 7. [BB] Since the undirected graph is a tree with n vertices, T has n  1 arcs, by Theorem 12.1.6. 8. The answer is no. The digraph shown has a unique vertex v of indegree o but it is not a rooted tree because the unoriented graph has a cycle....
View
Full
Document
This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.
 Summer '10
 any
 Graph Theory

Click to edit the document details