print "Degree C" print graph.deg_vertex(2) print "Vertices" print graph.list_vertices() print "Edges" print graph.list_edges() print "Incident Edges A" print graph.incident_edges(0) print "Incident Edges B" print graph.incident_edges(1) print "Incident Edges C" print graph.incident_edges(2) graph.remove_vertex(0) print "\nREMOVED VERTEX A\n" 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 print "Vertex C outgoing" print graph.V[2].Eo print "Degree B" print graph.deg_vertex(1)
for i, el in enumerate(graph.list_vertices()): print "Vertex " + str(el.getLabel()) + ": " + str(map(lambda x: x.getValue(), graph.outgoing_edges(el.getUid()))) print "\nAdjacent Incoming:" for i, el in enumerate(graph.list_vertices()): print "Vertex " + str(el.getLabel()) + ": " + str(map(lambda x: x.getLabel(), graph.adjacent_incoming(el.getUid()))) print "\nAdjacent Outgoing:" for i, el in enumerate(graph.list_vertices()): print "Vertex " + str(el.getLabel()) + ": " + str(map(lambda x: x.getLabel(), graph.adjacent_outgoing(el.getUid()))) print "\nRemoving an edge." graph.remove_edge(HNL_LAX) print "Removed an edge." print "\nNum Edges:" print graph.num_edges() print "\nDegree of LAX" print graph.deg_vertex(LAX) print "\nDegree of HNL" print graph.deg_vertex(HNL) print "\nRemoving a vertex" graph.remove_vertex(HNL) print "Removed a vertex" print "\nList Vertices" print map(lambda x: x.getLabel(), graph.list_vertices())
