forked from KaHIP/KaHIP
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSConscript
128 lines (116 loc) · 8.06 KB
/
SConscript
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
#/******************************************************************************
# * SConscript
# *
# * Source of KaHIP -- Karlsruhe High Quality Partitioning.
# *
# ******************************************************************************
# * Copyright (C) 2013 Christian Schulz <[email protected]>
# *
# * This program is free software: you can redistribute it and/or modify it
# * under the terms of the GNU General Public License as published by the Free
# * Software Foundation, either version 3 of the License, or (at your option)
# * any later version.
# *
# * This program is distributed in the hope that it will be useful, but WITHOUT
# * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
# * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
# * more details.
# *
# * You should have received a copy of the GNU General Public License along with
# * this program. If not, see <http://www.gnu.org/licenses/>.
# *****************************************************************************/
# The main SConscript file for the code.
#
# We simply import the main environment and then define the targets. This
# submodule contains a sequential matching and contraction code and tests for
# the code.
import platform
import sys
# Get the current platform.
SYSTEM = platform.uname()[0]
Import('env')
# Build a library from the code in lib/.
libkaffpa_files = [ 'lib/data_structure/graph_hierarchy.cpp',
'lib/algorithms/strongly_connected_components.cpp',
'lib/algorithms/topological_sort.cpp',
'lib/io/graph_io.cpp',
'lib/tools/quality_metrics.cpp',
'lib/tools/random_functions.cpp',
'lib/tools/graph_extractor.cpp',
'lib/tools/misc.cpp',
'lib/tools/partition_snapshooter.cpp',
'lib/partition/graph_partitioner.cpp',
'lib/partition/w_cycles/wcycle_partitioner.cpp',
'lib/partition/coarsening/coarsening.cpp',
'lib/partition/coarsening/contraction.cpp',
'lib/partition/coarsening/edge_rating/edge_ratings.cpp',
'lib/partition/coarsening/matching/matching.cpp',
'lib/partition/coarsening/matching/random_matching.cpp',
'lib/partition/coarsening/matching/gpa/path.cpp',
'lib/partition/coarsening/matching/gpa/gpa_matching.cpp',
'lib/partition/coarsening/matching/gpa/path_set.cpp',
'lib/partition/initial_partitioning/initial_partitioning.cpp',
'lib/partition/initial_partitioning/initial_partitioner.cpp',
'lib/partition/initial_partitioning/initial_partition_bipartition.cpp',
'lib/partition/initial_partitioning/initial_refinement/initial_refinement.cpp',
'lib/partition/initial_partitioning/bipartition.cpp',
'lib/partition/uncoarsening/uncoarsening.cpp',
'lib/partition/uncoarsening/separator/vertex_separator_algorithm.cpp',
'lib/partition/uncoarsening/separator/vertex_separator_flow_solver.cpp',
'lib/partition/uncoarsening/refinement/cycle_improvements/greedy_neg_cycle.cpp',
'lib/partition/uncoarsening/refinement/cycle_improvements/problem_factory.cpp',
'lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph.cpp',
'lib/partition/uncoarsening/refinement/refinement.cpp',
'lib/partition/uncoarsening/refinement/mixed_refinement.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/2way_fm_refinement/two_way_fm.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/two_way_flow_refinement.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/boundary_bfs.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/flow_solving_kernel/flow_solver.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/flow_solving_kernel/edge_cut_flow_solver.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/flow_solving_kernel/timer.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/flow_refinement/most_balanced_minimum_cuts/most_balanced_minimum_cuts.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/quotient_graph_refinement.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/complete_boundary.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/partial_boundary.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/quotient_graph_scheduling/quotient_graph_scheduling.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/quotient_graph_scheduling/simple_quotient_graph_scheduler.cpp',
'lib/partition/uncoarsening/refinement/quotient_graph_refinement/quotient_graph_scheduling/active_block_quotient_graph_scheduler.cpp',
'lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_graph_refinement.cpp',
'lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_graph_refinement_core.cpp',
'lib/partition/uncoarsening/refinement/kway_graph_refinement/kway_graph_refinement_commons.cpp',
'lib/partition/uncoarsening/refinement/cycle_improvements/augmented_Qgraph_fabric.cpp',
'lib/partition/uncoarsening/refinement/cycle_improvements/advanced_models.cpp',
'lib/partition/uncoarsening/refinement/kway_graph_refinement/multitry_kway_fm.cpp',
'lib/algorithms/cycle_search.cpp',
'lib/partition/uncoarsening/refinement/cycle_improvements/cycle_refinement.cpp',
'lib/parallel_mh/galinier_combine/gal_combine.cpp',
'lib/parallel_mh/galinier_combine/construct_partition.cpp',
'lib/partition/uncoarsening/refinement/tabu_search/tabu_search.cpp'
]
libkaffpa_parallel_async = ['lib/parallel_mh/parallel_mh_async.cpp',
'lib/parallel_mh/population.cpp',
'lib/parallel_mh/exchange/exchanger.cpp',
'lib/tools/graph_communication.cpp',
'lib/tools/mpi_tools.cpp' ]
if env['program'] == 'kaffpa':
env.Append(CXXFLAGS = '-DMODE_KAFFPA')
env.Append(CCFLAGS = '-DMODE_KAFFPA')
env.Program('kaffpa', ['app/kaffpa.cpp']+libkaffpa_files, LIBS=['libargtable2','gomp'])
if env['program'] == 'partition_to_vertex_separator':
env.Append(CXXFLAGS = '-DMODE_PARTITIONTOVERTEXSEPARATOR')
env.Append(CCFLAGS = '-DMODE_PARTITIONTOVERTEXSEPARATOR')
env.Program('partition_to_vertex_separator', ['app/partition_to_vertex_separator.cpp']+libkaffpa_files, LIBS=['libargtable2','gomp'])
if env['program'] == 'kaffpaE':
env.Append(CXXFLAGS = '-DMODE_KAFFPAE')
env.Append(CCFLAGS = '-DMODE_KAFFPAE')
if SYSTEM == 'Darwin':
env['CXX'] = 'openmpicxx'
else:
env['CXX'] = 'mpicxx'
env.Program('kaffpaE', ['app/kaffpaE.cpp']+libkaffpa_files+libkaffpa_parallel_async, LIBS=['libargtable2','gomp'])
if env['program'] == 'graphchecker':
env.Append(CXXFLAGS = '-DMODE_GRAPHCHECKER')
env.Append(CCFLAGS = '-DMODE_GRAPHCHECKER')
env.Program('graphchecker', ['app/graphchecker.cpp'], LIBS=['libargtable2','gomp'])
if env['program'] == 'library':
SConscript('interface/SConscript',exports='env')