Unformatted text preview: a.[5] by an adjacency matrix giving arc costs. Assume rows and columns are ordered alphabetically. b.[5] by a linked adjacency list with arc costs indicated. Assume that the list (vector) of vertices and the vertices on all adjacency lists are ordered alphabetically. a b c d e f 1 1 3 3 2 4 5 2 2 3 3 2 3 4 g h i 7 4 2 3 1 3 2...
View
Full Document
 Spring '03
 janicki
 Graph Theory, Derivative, Ring, adjacency matrix, Adjacency list, adjacency lists

Click to edit the document details