Here are a couple of observations:
- get_in_neighbours() worked fine prior to purging the edges.
- But once the edges are purged, the problem arises. Vertex 2, 3 and 4 should all have in neighbor 5, but g.get_in_neighbour(v) returns their own vertex index.
- get_in_edges() is working as intended.
Thanks a lot!
from graph_tool import *
# step 1: create a sample graph
g = Graph()
g.add_vertex(5)
eprop_share = g.new_edge_property("double")
eprop_majorShare = g.new_edge_property("boolean")
i=0.05
for v in g.vertices():
e = g.add_edge(5,v)
eprop_share[e]=i
i=i+0..
# step 2: purge all edges with <0.2 share
for e in g.edges():
if eprop_share[e] >= 0.2:
eprop_majorShare[e] = True
else:
eprop_majorShare[e] = False
g.set_edge_filter(eprop_majorShare)
g.purge_edges()
# step 3: understand why get_in_neighbours and get_in_edges give difference in neighbors
for v in g.vertices():
print('')
print("vertex id:")
print(v)
print('all out neighbors')
print(g.get_out_neighbours(v))
print('all in neighbors')
print(g.get_in_neighbours(v))
print('all in edges')
print(g.get_in_edges(v))
raw_input()