Python MyGraph.incoming_edges 예제들

예제 #1

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

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 --------"
print "Directed?"
for i, el in enumerate(graph.list_edges()):
	print "Edge " + str(el.getValue()) + ": " + str(el.is_directed())

print "\nIn degree:"
for i, el in enumerate(graph.list_vertices()):
	print "Vertex " + str(el.getLabel()) + ": " + str(graph.in_degree(el.getUid()))

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."