get multi-hop neighbors bug

[Sanzo00]

There is a small bug in PaGraph/PaGraph/partition/dg.py, there are no issues within two hops, but beyond two hops will result in a bug.

On line 26, all in_neighbors of neighs should be appended to nids list, not one of neighs.

PaGraph/PaGraph/partition/dg.py

Lines 18 to 27 in 263fb13

	def in_neighbors_hop(csc_adj, nid, hops):
	if hops == 1:
	return in_neighbors(csc_adj, nid)
	else:
	nids = []
	for depth in range(hops):
	neighs = nids[-1] if len(nids) != 0 else [nid]
	for n in neighs:
	nids.append(in_neighbors(csc_adj, n))
	return np.unique(np.hstack(nids))