Graphs & greedy algorithms

(Representation of graphs) Consider the following map 849 PVD 1843 ORD SFO 142 802 LGA 337 1205 1743 2555 HNL 1099 1387 LAX 1233 DFW 1120 MIA (a) (mathematical representation of a graph) note the graph has a label or weight on each edge. We touched this during class. To represent precisely such a graph, we need a triple (V, E, W) where V is the set of nodes of the graph, E the set of edges of the graph and W is a function (telling the label/weight on each edge, i.e., mapping an edge to a label). We learned how to represent V and E in the class. To represent W we can simply enumerate it in the following manner: W({SFO, LAX}) = 337, W({ORD, DFW}) = 802, ... etc. Write V, E and W. You don't have to enumerate all elements in the sets or the function W, and it is sufficient for you to include at least five "elements" for each of V, E and W