print "\nIncoming Edges:" for i, el in enumerate(graph.list_vertices()): print "Vertex " + str(el.getLabel()) + ": " + str(map(lambda x: x.getValue(), graph.incoming_edges(el.getUid()))) print "\nOutgoing Edges:" 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"
print graph.adjacent_vertices(1) print "C Adjacency" print graph.adjacent_vertices(2) # End vertices print "End vertices" print graph.end_vertices(2) # is adjacent? print "Are 2 and 1 adjacent? (should be true)" print graph.are_adjacent(2, 1) print "Are 2 and 2 adjacent? (should be false)" print graph.are_adjacent(2, 2) print "Are 1 and 2 adjacent? (should be true)" print graph.are_adjacent(1, 2) print "Are 0 and 2 adjacent? (should be false)" print graph.are_adjacent(0, 2) print "Adjacent incoming A" print map(lambda x: x.getUid(), graph.adjacent_incoming(0)) print "Adjacent incoming B" print map(lambda x: x.getUid(), graph.adjacent_incoming(1)) print "Adjacent incoming C" print map(lambda x: x.getUid(), graph.adjacent_incoming(2)) print "Adjacent outgoing A" print map(lambda x: x.getUid(), graph.adjacent_outgoing(0)) print "Adjacent outgoing B" print map(lambda x: x.getUid(), graph.adjacent_outgoing(1)) print "Adjacent outgoing C" print map(lambda x: x.getUid(), graph.adjacent_outgoing(2))
