def test_ktruss_subgraph_Graph(graph_file, nx_ground_truth):
gc.collect()
k = 5
cu_M = utils.read_csv_file(graph_file)
G = cugraph.Graph()
G.from_cudf_edgelist(cu_M, source="0", destination="1", edge_attr="2")
k_subgraph = cugraph.ktruss_subgraph(G, k)
compare_k_truss(k_subgraph, k, nx_ground_truth)
def cugraph_k_truss_subgraph(graph_file, k, directed):
# directed is used to create either a Graph or DiGraph so the returned
# cugraph can be compared to nx graph of same type.
cu_M = utils.read_csv_file(graph_file)
if directed:
G = cugraph.DiGraph()
else:
G = cugraph.Graph()
G.from_cudf_edgelist(cu_M, source='0', destination='1', edge_attr='2')
k_subgraph = cugraph.ktruss_subgraph(G, k)
return k_subgraph
def cugraph_k_truss_subgraph(graph_file, k):
cu_M = utils.read_csv_file(graph_file)
G = cugraph.Graph()
G.from_cudf_edgelist(cu_M, source="0", destination="1", edge_attr="2")
k_subgraph = cugraph.ktruss_subgraph(G, k)
return k_subgraph
def cugraph_k_truss_subgraph(graph_file, k):
cu_M = utils.read_csv_file(graph_file)
G = cugraph.DiGraph()
G.from_cudf_edgelist(cu_M, source='0', destination='1', edge_attr='2')
k_subgraph = cugraph.ktruss_subgraph(G, k)
return k_subgraph