1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
# Copyright (C) 2021 Garth N. Wells
#
# This file is part of DOLFINx (https://www.fenicsproject.org)
#
# SPDX-License-Identifier: LGPL-3.0-or-later
"""Graph representations and operations on graphs."""
from __future__ import annotations
import numpy as np
from dolfinx import cpp as _cpp
from dolfinx.cpp.graph import partitioner
# Import graph partitioners, which may or may not be available
# (dependent on build configuration)
try:
from dolfinx.cpp.graph import partitioner_scotch # noqa
except ImportError:
pass
try:
from dolfinx.cpp.graph import partitioner_parmetis # noqa
except ImportError:
pass
try:
from dolfinx.cpp.graph import partitioner_kahip # noqa
except ImportError:
pass
__all__ = ["adjacencylist", "partitioner"]
def adjacencylist(data: np.ndarray, offsets=None):
"""Create an AdjacencyList for int32 or int64 datasets.
Args:
data: The adjacency array. If the array is one-dimensional,
offsets should be supplied. If the array is two-dimensional
the number of edges per node is the second dimension.
offsets: The offsets array with the number of edges per node.
Returns:
An adjacency list.
"""
if offsets is None:
try:
return _cpp.graph.AdjacencyList_int32(data)
except TypeError:
return _cpp.graph.AdjacencyList_int64(data)
else:
try:
return _cpp.graph.AdjacencyList_int32(data, offsets)
except TypeError:
return _cpp.graph.AdjacencyList_int64(data, offsets)
|
