Graphs & greedy algorithms

(Representation of graphs) Consider the following map 849 PVD 1843 ORD SFO 142 802 LGA 1743 337 1205 2555 1099 HNL 1387 1233 LAX DFW 1120 MIA (b) (data structure representing a graph) ignore the numbers on edges. Represent the graph in linked list. Follow the form in Section 3.1 of L4. 3. How to represent a graph (data structure) Problem to answer: is a given pair u, v an edge in the graph? 3.1 Linked list pseudocode data structure 1->2->3 Il neighbors of node 1 2->1->3->5->4 // n->... Let e be the number of edges of the graph, n be the number of nodes in the graph Size of the graph representation in linked list: e * 2 + n, bigo of this size is (# of edges + # of nodes) e+n. Implementation node[1] ... node[n].node[i] contains the linked list for node i define linked list