Python MyGraph.remove_edge 예제들

예제 #1

파일: tester.py 프로젝트: adekau/ClassWork

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"
graph.remove_vertex(HNL)
print "Removed a vertex"

print "\nList Vertices"

예제 #2

파일: test_eremoval.py 프로젝트: adekau/ClassWork

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)


print "\n"
print graph.vertex(0).aV
print graph.vertex(1).aV

graph.remove_edge(0)

print "\nREMOVED EDGE\n"

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
print "Vertex C outgoing"
print graph.V[2].Eo

예제 #3

파일: test_adjrem.py 프로젝트: adekau/ClassWork

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))

graph.remove_edge(5)

print "REMOVED EDGE\n\n"

print "A Adjacency"
print graph.vertex(0).aV
print "B Adjacency"
print graph.vertex(1).aV
print "C Adjacency"
print graph.vertex(2).aV

print "\nDuplicate using function\n"

print "A Adjacency"
print graph.adjacent_vertices(0)
print "B Adjacency"