JitGraph

__init__(edge_index, num_nodes=None, adj_index=None, degree=None)[source]

Methods

`__init__`
`adj`
`connected_component_ids`	return nodes in breadth-first-search order
`is_edge`
`neighbours`
`nodes_in_lcc`	List all nodes in the largest connected component
`partition_graph`
`partition_graph_edges`
`sample_negative_edges`
`sample_positive_edges`
`subgraph`
`subgraph_edges`

Attributes

`class_type`
`num_edges`