MthSc 816 — Assignment #1 (Primal Journey)
Data Structures (for G)
As read in each edge, create linked adjacency lists for every node v.
Adjacency list for v represented by a start pointer and a linked list:
start(v) = pointer to start of linked list for node v = 1, 2, …, n
{to, dist, next} for each record of linked list
Space needed for these linked lists is O(n + 6m), if G has m edges.
Initialize using first(v) = NIL for all v.
No need to have elements (nodes adjacent to v) sorted in order.
Input
Read in successive undirected edges (v,w):
add_edge(v,w), add_edge(w,v)
In add_edge(v,w) function, insert w at the front of linked list for v. This
saves extra space for keeping track of end of each linked list.
