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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
## SPDX-License-Identifier: BSD-2-Clause
##
## Copyright 2020-2025 Inria & Université de Bordeaux
##
## Redistribution and use in source and binary forms, with or without
## modification, are permitted provided that the following conditions
## are met:
##
## 1. Redistributions of source code must retain the above copyright
## notice, this list of conditions and the following disclaimer.
##
## 2. Redistributions in binary form must reproduce the above
## copyright notice, this list of conditions and the following
## disclaimer in the documentation and/or other materials provided
## with the distribution.
##
## THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
## CONTRIBUTORS “AS IS” AND ANY EXPRESS OR IMPLIED WARRANTIES,
## INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
## MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
## DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
## BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
## EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
## TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
## DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
## ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
## TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
## THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
## SUCH DAMAGE.
##
import numpy as np
import scotchpy as SCOTCH
# taken from check/test_strat_seq.c
def testDEFAULT1():
stratt = SCOTCH.Strat(init=False)
stratt.init()
stratt.graph_map_build(SCOTCH.STRATDEFAULT, 16, 0.03)
stratt.exit()
def testRECURSIVE():
stratt = SCOTCH.Strat(init=False)
stratt.init()
stratt.graph_map_build(SCOTCH.STRATRECURSIVE, 16, 0.03)
stratt.exit()
def testREMAP():
stratt = SCOTCH.Strat(init=False)
stratt.init()
stratt.graph_map_build(SCOTCH.STRATREMAP, 16, 0.03)
stratt.exit()
def testRECURSIVE_REMAP():
stratt = SCOTCH.Strat(init=False)
stratt.init()
stratt.graph_map_build(SCOTCH.STRATRECURSIVE + SCOTCH.STRATREMAP, 16, 0.03)
stratt.exit()
def testDEFAULT2():
stratt = SCOTCH.Strat(init=False)
stratt.init()
stratt.graph_order_build(SCOTCH.STRATDEFAULT, 0, 0.2)
stratt.exit()
def testDISCONNECTED():
stratt = SCOTCH.Strat(init=False)
stratt.init()
stratt.graph_order_build(SCOTCH.STRATDISCONNECTED, 3, 0.2)
stratt.exit()
def testLEVELMAX():
stratt = SCOTCH.Strat(init=False)
stratt.init()
stratt.graph_order_build(SCOTCH.STRATLEVELMAX, 3, 0.2)
stratt.exit()
def testLEVELMIN():
stratt = SCOTCH.Strat(init=False)
stratt.init()
stratt.graph_order_build(SCOTCH.STRATLEVELMIN, 3, 0.2)
stratt.exit()
def testLEVELMAX_LEVELMIN():
stratt = SCOTCH.Strat(init=False)
stratt.init()
stratt.graph_order_build(SCOTCH.STRATLEVELMAX + SCOTCH.STRATLEVELMIN, 3, 0.2)
stratt.exit()
def testLEAFSIMPLE():
stratt = SCOTCH.Strat(init=False)
stratt.init()
stratt.graph_order_build(SCOTCH.STRATLEAFSIMPLE, 3, 0.2)
stratt.exit()
def testSEPASIMPLE():
stratt = SCOTCH.Strat(init=False)
stratt.init()
stratt.graph_order_build(SCOTCH.STRATSEPASIMPLE, 3, 0.2)
stratt.exit()
|
