1e37926ab8
The MCL algorithm is short for the Markov Cluster Algorithm, a fast and scalable cluster algorithm for graphs based on simulation of (stochastic) flow in graphs. The algorithm was developed by Stijn van Dongen at the Centre for Mathematics and Computer Science (also known as CWI) in the Netherlands. The MCL algorithm is very fast, very scalable, and has a number of attractive properties causing it to deliver high-quality clusterings. WWW: http://micans.org/mcl/ from Andreas Kahari <andreas.kahari@unix.net>
12 lines
259 B
Plaintext
12 lines
259 B
Plaintext
$OpenBSD: patch-util_heap_c,v 1.1.1.1 2003/07/08 10:55:20 sturm Exp $
|
|
--- util/heap.c.orig Tue Jul 8 12:22:29 2003
|
|
+++ util/heap.c Tue Jul 8 12:22:41 2003
|
|
@@ -8,6 +8,7 @@
|
|
|
|
|
|
#include <stdio.h>
|
|
+#include <string.h>
|
|
|
|
#include "alloc.h"
|
|
#include "heap.h"
|