Skip to content
This repository was archived by the owner on May 1, 2024. It is now read-only.

Experimental MultiGraph support #63

Open
Lamaun wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Experimental MultiGraph support #63

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
25 changes: 20 additions & 5 deletions nxmetis/__init__.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -51,6 +51,18 @@ def _convert_graph(G):
xadj.append(len(adjncy))
return xadj, adjncy

def _convert_multi_graph(G):
"""Convert a MultiGraph to the numbered adjacency list structure expected by
METIS.
"""
index = dict(zip(G, list(range(len(G)))))
xadj = [0]
adjncy = []
for u in G:
for v in G[u]:
adjncy.extend(index[v] for h in dict(G[u])[v])
xadj.append(len(adjncy))
return xadj, adjncy

def _convert_exceptions(convert_type, catch_types=None):
"""Decorator to convert types of exceptions
Expand Down Expand Up @@ -92,7 +104,6 @@ def _convert_exceptions(func, *args, **kwargs):


@nx.utils.not_implemented_for('directed')
@nx.utils.not_implemented_for('multigraph')
@_convert_exceptions(
nx.NetworkXError, (ValueError, TypeError, exceptions.MetisError))
def node_nested_dissection(G, weight='weight', options=None):
Expand Down Expand Up @@ -131,7 +142,10 @@ def node_nested_dissection(G, weight='weight', options=None):
if all(w == 1 for w in vwgt):
vwgt = None

xadj, adjncy = _convert_graph(G)
if(isinstance(G,nx.MultiGraph)):
xadj, adjncy = _convert_multi_graph(G)
else:
xadj, adjncy = _convert_graph(G)

with _zero_numbering(options):
perm = metis.node_nd(xadj, adjncy, vwgt, options)[0]
Expand All @@ -143,7 +157,6 @@ def node_nested_dissection(G, weight='weight', options=None):


@nx.utils.not_implemented_for('directed')
@nx.utils.not_implemented_for('multigraph')
@_convert_exceptions(
nx.NetworkXError, (ValueError, TypeError, exceptions.MetisError))
def partition(G, nparts, node_weight='weight', node_size='size',
Expand Down Expand Up @@ -225,7 +238,10 @@ def partition(G, nparts, node_weight='weight', node_size='size',
if len(G) == 0:
return 0, [[] for i in range(nparts)]

xadj, adjncy = _convert_graph(G)
if(isinstance(G,nx.MultiGraph)):
xadj, adjncy = _convert_multi_graph(G)
else:
xadj, adjncy = _convert_graph(G)

vwgt = [G.nodes[u].get(node_weight, 1) for u in G]
if all(w == 1 for w in vwgt):
Expand Down Expand Up @@ -264,7 +280,6 @@ def partition(G, nparts, node_weight='weight', node_size='size',


@nx.utils.not_implemented_for('directed')
@nx.utils.not_implemented_for('multigraph')
@_convert_exceptions(
nx.NetworkXError, (ValueError, TypeError, exceptions.MetisError))
def vertex_separator(G, weight='weight', options=None):
Expand Down