(
self, hops=2, i_level=1, k=1, by_size=False, by_class=False,
use_batch=True, disjoint=False)
| 789 | Hence, if two subgraphs share a node, they will be connected |
| 790 | """ |
| 791 | def __init__( |
| 792 | self, hops=2, i_level=1, k=1, by_size=False, by_class=False, |
| 793 | use_batch=True, disjoint=False): |
| 794 | super().__init__( |
| 795 | i_level=i_level, k=k, by_size=by_size, by_class=by_class, |
| 796 | use_batch=use_batch, disjoint=disjoint) |
| 797 | self.hops = hops |
| 798 | |
| 799 | def _sample_subgraphs(self, nag, i_level, idx): |
| 800 | assert nag[i_level].has_edges, \ |