METIS is a family of programs for partitioning unstructured graphs and hypergraphs and computing fill-reducing orderings of sparse matrices. The underlying algorithms used by METIS are based on the state-of-the-art multilevel paradigm that has been shown to produce high quality results and scale to very large problems. It is available both as a set of stand-alone programs and as a library.
32 lines
570 B
Text
32 lines
570 B
Text
$NetBSD: patch-aa,v 1.1.1.1 2001/02/10 04:18:37 jtb Exp $
|
|
|
|
--- Makefile.in.orig Wed Feb 7 21:16:07 2001
|
|
+++ Makefile.in
|
|
@@ -1,21 +1,21 @@
|
|
|
|
# Which compiler to use
|
|
-CC = cc
|
|
+#CC = cc
|
|
|
|
# What optimization level to use
|
|
-OPTFLAGS = -O2
|
|
+#OPTFLAGS = -O2
|
|
|
|
# What options to be used by the compiler
|
|
-COPTIONS =
|
|
+#COPTIONS =
|
|
|
|
# What options to be used by the loader
|
|
-LDOPTIONS =
|
|
+LDOPTIONS = $(LDFLAGS)
|
|
|
|
# What archiving to use
|
|
-AR = ar rv
|
|
+#AR = ar rv
|
|
|
|
# What to use for indexing the archive
|
|
-RANLIB = ranlib
|
|
+#RANLIB = ranlib
|
|
#RANLIB = ar -ts
|
|
#RANLIB =
|
|
|