https://github.com/kit-parco/networkit
Tip revision: 4a772bc4b608efde2412d4498f931c0aabc35c43 authored by Fabian Brandt on 01 July 2021, 15:55:31 UTC
Merge pull request #783 from fabratu/fix-compiler-search
Merge pull request #783 from fabratu/fix-compiler-search
Tip revision: 4a772bc
nxadapter.py
"""
This module handles compatibility between NetworKit and NetworkX
"""
# local imports
from . import graph
import warnings
from .support import MissingDependencyError
# non standard library modules / external
try:
import networkx as nx
except ImportError:
have_nx = False
else:
have_nx = True
######## CONVERSION ########
def nx2nk(nxG, weightAttr=None):
"""
Convert a networkx.Graph to a NetworKit.Graph
:param weightAttr: the edge attribute which should be treated as the edge weight.
"""
if not have_nx:
raise MissingDependencyError("networkx")
# map networkx node ids to consecutive numerical node ids
idmap = dict((id, u) for (id, u) in zip(nxG.nodes(), range(nxG.number_of_nodes())))
z = max(idmap.values()) + 1
# print("z = {0}".format(z))
if weightAttr is not None:
nkG = graph.Graph(z, weighted=True, directed=nxG.is_directed())
for (u_, v_) in nxG.edges():
u, v = idmap[u_], idmap[v_]
w = nxG[u_][v_][weightAttr]
nkG.addEdge(u, v, w)
else:
nkG = graph.Graph(z, directed=nxG.is_directed())
for (u_, v_) in nxG.edges():
u, v = idmap[u_], idmap[v_]
assert (u < z)
assert (v < z)
nkG.addEdge(u, v)
assert (nkG.numberOfNodes() == nxG.number_of_nodes())
assert (nkG.numberOfEdges() == nxG.number_of_edges())
return nkG
def nk2nx(nkG):
""" Convert a NetworKit.Graph to a networkx.Graph """
if not have_nx:
raise MissingDependencyError("networkx")
if nkG.isDirected():
nxG = nx.DiGraph()
else:
nxG = nx.Graph()
nxG.add_nodes_from(nkG.iterNodes())
if nkG.isWeighted():
for u, v, w in nkG.iterEdgesWeights():
nxG.add_edge(u, v, weight=w)
else:
nxG.add_edges_from(nkG.iterEdges())
assert (nkG.numberOfNodes() == nxG.number_of_nodes())
assert (nkG.numberOfEdges() == nxG.number_of_edges())
return nxG