print "Degree A" print graph.deg_vertex(0) print "Degree B" print graph.deg_vertex(1) 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 "\nVertices:" print graph.list_vertices() print "\nEdges:" print graph.list_edges() print "\nVertex test:" print graph.vertex(graph.list_vertices()[0].getUid()).getLabel() print "\nDegree vertices:" for i, el in enumerate(graph.list_vertices()): print "Vertex " + str(el.getLabel()) + ": " + str(graph.deg_vertex(el.getUid())) print "\nIncident Edges:" for i, el in enumerate(graph.list_vertices()): print "Vertex " + str(el.getLabel()) + ": " + str(map(lambda x: x.getValue(), graph.incident_edges(el.getUid()))) print "\nAdjacent Vertices:" for i, el in enumerate(graph.list_vertices()): print "Vertex " + str(el.getLabel()) + ": " + str(map(lambda x: x.getLabel(), graph.adjacent_vertices(el.getUid()))) print "\nEnd Vertices:" for i, el in enumerate(graph.list_edges()): print "Edge " + str(el.getValue()) + ": " + str(map(lambda x: graph.vertex(x).getLabel(), graph.end_vertices(el.getUid()))) print "\nAre Adjacent?" for i, el1 in enumerate(graph.list_vertices()): for j, el2 in enumerate(graph.list_vertices()): print "Vertices " + str(el1.getLabel()) + ", " + str(el2.getLabel()) + ": " + str(graph.are_adjacent(el1.getUid(), el2.getUid())) print "\n\n DIRECTED GRAPH STUFF --------"
