GetInEgonetHop¶
-
GetInEgonetHop
(NId, H)¶
A graph method that returns an H hop in-ego network of the node NId. The H hop in-ego network includes the node NId, its in-neighbours and edges that connect them to the origin node, then all their in-neighbours and edges and so on until H hop neighbours.
Parameters:
- NId: int
Id of the center node of the ego network.
- H: int
The number of hops for the ego network.
Return value:
- graph
A graph of the same type as the input graph, containing the in-ego network for NId.
The following example shows how to create a subgraph for nodes in
TNGraph
, TUNGraph
, and TNEANet
:
import snap
NGraph = snap.GenRndGnm(snap.TNGraph, 100, 1000)
InEgonet = NGraph.GetInEgonetHop(0, 2)
UGraph = snap.GenRndGnm(snap.TUNGraph, 100, 1000)
InEgonet = UGraph.GetInEgonetHop(3, 1)
Network = snap.GenRndGnm(snap.TNEANet, 100, 1000)
InEgonet = Network.GetInEgonetHop(10, 3)