graphblas-algorithms/graphblas_algorithms/nxapi/operators/binary.py at main · python-graphblas/graphblas-algorithms · GitHub

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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
from graphblas_algorithms import algorithms
from graphblas_algorithms.classes.digraph import to_graph

from ..exception import NetworkXError

__all__ = [
    "compose",
    "difference",
    "disjoint_union",
    "full_join",
    "intersection",
    "symmetric_difference",
    "union",
]


def union(G, H, rename=()):
    G = to_graph(G)
    H = to_graph(H)
    try:
        return algorithms.union(G, H, rename=rename)
    except algorithms.exceptions.GraphBlasAlgorithmException as e:
        raise NetworkXError(*e.args) from e


def disjoint_union(G, H):
    G = to_graph(G)
    H = to_graph(H)
    try:
        return algorithms.disjoint_union(G, H)
    except algorithms.exceptions.GraphBlasAlgorithmException as e:
        raise NetworkXError(*e.args) from e


def intersection(G, H):
    G = to_graph(G)
    H = to_graph(H)
    try:
        return algorithms.intersection(G, H)
    except algorithms.exceptions.GraphBlasAlgorithmException as e:
        raise NetworkXError(*e.args) from e


def difference(G, H):
    G = to_graph(G)
    H = to_graph(H)
    try:
        return algorithms.difference(G, H)
    except algorithms.exceptions.GraphBlasAlgorithmException as e:
        raise NetworkXError(*e.args) from e


def symmetric_difference(G, H):
    G = to_graph(G)
    H = to_graph(H)
    try:
        return algorithms.symmetric_difference(G, H)
    except algorithms.exceptions.GraphBlasAlgorithmException as e:
        raise NetworkXError(*e.args) from e


def compose(G, H):
    G = to_graph(G)
    H = to_graph(H)
    try:
        return algorithms.compose(G, H)
    except algorithms.exceptions.GraphBlasAlgorithmException as e:
        raise NetworkXError(*e.args) from e


def full_join(G, H, rename=()):
    G = to_graph(G)
    H = to_graph(H)
    try:
        return algorithms.full_join(G, H, rename=rename)
    except algorithms.exceptions.GraphBlasAlgorithmException as e:
        raise NetworkXError(*e.args) from e