#Date: 11/11/2016 #Class: CS4310 #Assignment: Assignment 7 #Author(s): Alex Dekau from MyGraph import MyGraph graph = MyGraph() # Verticies graph.new_vertex("A") #0 graph.new_vertex("B") #1 graph.new_vertex("C") #2 #Edges-Undirected graph.new_edge(0, 1) #0 graph.new_edge(0, 1, True) #1 graph.new_edge(1, 2) #2 graph.new_edge(2, 1, True) #3 graph.new_edge(2, 2) #4 print "Vertex A incoming" print graph.V[0].Ei print "Vertex A outgoing" print graph.V[0].Eo print "Vertex B incoming" print graph.V[1].Ei print "Vertex B outgoing" print graph.V[1].Eo print "Vertex C incoming" print graph.V[2].Ei
#Author(s): Alex Dekau from MyGraph import MyGraph graph = MyGraph("Assignment 7") HNL = graph.new_vertex("HNL") LAX = graph.new_vertex("LAX") SFO = graph.new_vertex("SFO") ORD = graph.new_vertex("ORD") DFW = graph.new_vertex("DFW") LGA = graph.new_vertex("LGA") PVD = graph.new_vertex("PVD") MIA = graph.new_vertex("MIA") HNL_LAX = graph.new_edge(HNL, LAX, value=2555) LAX_SFO = graph.new_edge(LAX, SFO, value=337) LAX_DFW = graph.new_edge(LAX, DFW, value=1233) LAX_ORD = graph.new_edge(LAX, ORD, True, value=1743) SFO_ORD = graph.new_edge(SFO, ORD, value=1843) ORD_PVD = graph.new_edge(ORD, PVD, value=849) ORD_DFW = graph.new_edge(ORD, DFW, value=802) DFW_LGA = graph.new_edge(DFW, LGA, value=1387) DFW_MIA = graph.new_edge(DFW, MIA, value=1120) LGA_MIA = graph.new_edge(LGA, MIA, value=1099) PVD_LGA = graph.new_edge(PVD, LGA, True, value=142) PVD_MIA = graph.new_edge(PVD, MIA, value=1205) print "Num vertices (should be 8)" print graph.num_vertices()