2c03-review - 00076

2c03-review - 00076 - a.[5] by an adjacency matrix giving...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
3 b.[8] Linked adjacency lists Assume the ADT LIST is defined with proper functions implemented. function FIRST(v:integer): position begin return(FIRST_LIST(A[v])) end function NEXT(v:integer, i:position): position begin return(NEXT_LIST(A[v],i)) end function VERTEX(v:integer, i:position): integer begin return(RETRIEVE(i,A[v])) end 4.[10] Represent the weighted directed graph below
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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

This note was uploaded on 12/10/2009 for the course CAS 2c03 taught by Professor Janicki during the Spring '03 term at McMaster University.

Ask a homework question - tutors are online