First commit on github -- NetBunch 1.0

1 files changed, 54 insertions, 0 deletions

diff --git a/src/knn/knntree.h b/src/knn/knntree.h
new file mode 100644
index 0000000..d64417e
--- /dev/null
+++ b/src/knn/knntree.h
@@ -0,0 +1,54 @@
+/**
+ *  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/>.
+ *
+ *  (c) Vincenzo Nicosia 2009-2017 -- <v.nicosia@qmul.ac.uk>
+ * 
+ *  This file is part of NetBunch, a package for complex network
+ *  analysis and modelling. For more information please visit:
+ *
+ *             http://www.complex-networks.net/
+ *
+ *  If you use this software, please add a reference to 
+ *
+ *               V. Latora, V. Nicosia, G. Russo             
+ *   "Complex Networks: Principles, Methods and Applications"
+ *              Cambridge University Press (2017) 
+ *                ISBN: 9781107103184
+ *
+ ***********************************************************************
+ *
+ *  Functions needed to manage the BST.
+ *
+ */
+
+
+#ifndef __KNNTREE_H__
+#define __KNNTREE_H__
+
+#include "iltree.h"
+
+typedef struct{
+  int k; /* node degree*/
+  int Nk; /* number of nodes with degree k */
+  double knnsum; /* sum of the degrees of the neighbours of all the Nk nodes */
+} knnsum_t;
+
+
+typedef iltree_t  knntree_t;
+
+knntree_t knntree_init(knntree_t t, void *fileout);
+
+
+#endif //__KNNTREE_H__