summaryrefslogtreecommitdiff
path: root/src/knn
diff options
context:
space:
mode:
Diffstat (limited to 'src/knn')
-rw-r--r--src/knn/Makefile.am11
-rw-r--r--src/knn/Makefile.in600
-rw-r--r--src/knn/knn.c349
-rw-r--r--src/knn/knn_w.c355
-rw-r--r--src/knn/knntree.c95
-rw-r--r--src/knn/knntree.h54
6 files changed, 1464 insertions, 0 deletions
diff --git a/src/knn/Makefile.am b/src/knn/Makefile.am
new file mode 100644
index 0000000..e9059ad
--- /dev/null
+++ b/src/knn/Makefile.am
@@ -0,0 +1,11 @@
+include ../common.mk
+bin_PROGRAMS = knn knn_w
+knn_SOURCES = knn.c knntree.c knntree.h \
+../utils/utils.c ../utils/iltree.c \
+../include/utils.h ../include/iltree.h
+knn_LDADD = -lm
+knn_w_SOURCES = knn_w.c knntree.c knntree.h \
+../utils/utils.c ../utils/iltree.c \
+../include/utils.h ../include/iltree.h
+knn_w_LDADD = -lm
+
diff --git a/src/knn/Makefile.in b/src/knn/Makefile.in
new file mode 100644
index 0000000..baefe62
--- /dev/null
+++ b/src/knn/Makefile.in
@@ -0,0 +1,600 @@
+# Makefile.in generated by automake 1.15 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994-2014 Free Software Foundation, Inc.
+
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+@SET_MAKE@
+
+VPATH = @srcdir@
+am__is_gnu_make = { \
+ if test -z '$(MAKELEVEL)'; then \
+ false; \
+ elif test -n '$(MAKE_HOST)'; then \
+ true; \
+ elif test -n '$(MAKE_VERSION)' && test -n '$(CURDIR)'; then \
+ true; \
+ else \
+ false; \
+ fi; \
+}
+am__make_running_with_option = \
+ case $${target_option-} in \
+ ?) ;; \
+ *) echo "am__make_running_with_option: internal error: invalid" \
+ "target option '$${target_option-}' specified" >&2; \
+ exit 1;; \
+ esac; \
+ has_opt=no; \
+ sane_makeflags=$$MAKEFLAGS; \
+ if $(am__is_gnu_make); then \
+ sane_makeflags=$$MFLAGS; \
+ else \
+ case $$MAKEFLAGS in \
+ *\\[\ \ ]*) \
+ bs=\\; \
+ sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \
+ | sed "s/$$bs$$bs[$$bs $$bs ]*//g"`;; \
+ esac; \
+ fi; \
+ skip_next=no; \
+ strip_trailopt () \
+ { \
+ flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \
+ }; \
+ for flg in $$sane_makeflags; do \
+ test $$skip_next = yes && { skip_next=no; continue; }; \
+ case $$flg in \
+ *=*|--*) continue;; \
+ -*I) strip_trailopt 'I'; skip_next=yes;; \
+ -*I?*) strip_trailopt 'I';; \
+ -*O) strip_trailopt 'O'; skip_next=yes;; \
+ -*O?*) strip_trailopt 'O';; \
+ -*l) strip_trailopt 'l'; skip_next=yes;; \
+ -*l?*) strip_trailopt 'l';; \
+ -[dEDm]) skip_next=yes;; \
+ -[JT]) skip_next=yes;; \
+ esac; \
+ case $$flg in \
+ *$$target_option*) has_opt=yes; break;; \
+ esac; \
+ done; \
+ test $$has_opt = yes
+am__make_dryrun = (target_option=n; $(am__make_running_with_option))
+am__make_keepgoing = (target_option=k; $(am__make_running_with_option))
+pkgdatadir = $(datadir)/@PACKAGE@
+pkgincludedir = $(includedir)/@PACKAGE@
+pkglibdir = $(libdir)/@PACKAGE@
+pkglibexecdir = $(libexecdir)/@PACKAGE@
+am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
+install_sh_DATA = $(install_sh) -c -m 644
+install_sh_PROGRAM = $(install_sh) -c
+install_sh_SCRIPT = $(install_sh) -c
+INSTALL_HEADER = $(INSTALL_DATA)
+transform = $(program_transform_name)
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+bin_PROGRAMS = knn$(EXEEXT) knn_w$(EXEEXT)
+subdir = src/knn
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+ $(ACLOCAL_M4)
+DIST_COMMON = $(srcdir)/Makefile.am $(am__DIST_COMMON)
+mkinstalldirs = $(install_sh) -d
+CONFIG_HEADER = $(top_builddir)/config.h
+CONFIG_CLEAN_FILES =
+CONFIG_CLEAN_VPATH_FILES =
+am__installdirs = "$(DESTDIR)$(bindir)"
+PROGRAMS = $(bin_PROGRAMS)
+am__dirstamp = $(am__leading_dot)dirstamp
+am_knn_OBJECTS = knn.$(OBJEXT) knntree.$(OBJEXT) \
+ ../utils/utils.$(OBJEXT) ../utils/iltree.$(OBJEXT)
+knn_OBJECTS = $(am_knn_OBJECTS)
+knn_DEPENDENCIES =
+am_knn_w_OBJECTS = knn_w.$(OBJEXT) knntree.$(OBJEXT) \
+ ../utils/utils.$(OBJEXT) ../utils/iltree.$(OBJEXT)
+knn_w_OBJECTS = $(am_knn_w_OBJECTS)
+knn_w_DEPENDENCIES =
+AM_V_P = $(am__v_P_@AM_V@)
+am__v_P_ = $(am__v_P_@AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_@AM_V@)
+am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)
+am__v_GEN_0 = @echo " GEN " $@;
+am__v_GEN_1 =
+AM_V_at = $(am__v_at_@AM_V@)
+am__v_at_ = $(am__v_at_@AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 =
+DEFAULT_INCLUDES = -I.@am__isrc@ -I$(top_builddir)
+depcomp = $(SHELL) $(top_srcdir)/depcomp
+am__depfiles_maybe = depfiles
+am__mv = mv -f
+COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
+ $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
+AM_V_CC = $(am__v_CC_@AM_V@)
+am__v_CC_ = $(am__v_CC_@AM_DEFAULT_V@)
+am__v_CC_0 = @echo " CC " $@;
+am__v_CC_1 =
+CCLD = $(CC)
+LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
+AM_V_CCLD = $(am__v_CCLD_@AM_V@)
+am__v_CCLD_ = $(am__v_CCLD_@AM_DEFAULT_V@)
+am__v_CCLD_0 = @echo " CCLD " $@;
+am__v_CCLD_1 =
+SOURCES = $(knn_SOURCES) $(knn_w_SOURCES)
+DIST_SOURCES = $(knn_SOURCES) $(knn_w_SOURCES)
+am__can_run_installinfo = \
+ case $$AM_UPDATE_INFO_DIR in \
+ n|no|NO) false;; \
+ *) (install-info --version) >/dev/null 2>&1;; \
+ esac
+am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)
+# Read a list of newline-separated strings from the standard input,
+# and print each of them once, without duplicates. Input order is
+# *not* preserved.
+am__uniquify_input = $(AWK) '\
+ BEGIN { nonempty = 0; } \
+ { items[$$0] = 1; nonempty = 1; } \
+ END { if (nonempty) { for (i in items) print i; }; } \
+'
+# Make sure the list of sources is unique. This is necessary because,
+# e.g., the same source file might be shared among _SOURCES variables
+# for different programs/libraries.
+am__define_uniq_tagged_files = \
+ list='$(am__tagged_files)'; \
+ unique=`for i in $$list; do \
+ if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+ done | $(am__uniquify_input)`
+ETAGS = etags
+CTAGS = ctags
+am__DIST_COMMON = $(srcdir)/../common.mk $(srcdir)/Makefile.in \
+ $(top_srcdir)/depcomp
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CC = @CC@
+CCDEPMODE = @CCDEPMODE@
+CFLAGS = @CFLAGS@
+CPPFLAGS = @CPPFLAGS@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+DEPDIR = @DEPDIR@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+EXEEXT = @EXEEXT@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LDFLAGS = @LDFLAGS@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LTLIBOBJS = @LTLIBOBJS@
+MAKEINFO = @MAKEINFO@
+MKDIR_P = @MKDIR_P@
+OBJEXT = @OBJEXT@
+PACKAGE = @PACKAGE@
+PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
+PACKAGE_NAME = @PACKAGE_NAME@
+PACKAGE_STRING = @PACKAGE_STRING@
+PACKAGE_TARNAME = @PACKAGE_TARNAME@
+PACKAGE_URL = @PACKAGE_URL@
+PACKAGE_VERSION = @PACKAGE_VERSION@
+PATH_SEPARATOR = @PATH_SEPARATOR@
+RONN = @RONN@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+STRIP = @STRIP@
+VERSION = @VERSION@
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+ac_ct_CC = @ac_ct_CC@
+am__include = @am__include@
+am__leading_dot = @am__leading_dot@
+am__quote = @am__quote@
+am__tar = @am__tar@
+am__untar = @am__untar@
+bindir = @bindir@
+build_alias = @build_alias@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host_alias = @host_alias@
+htmldir = @htmldir@
+includedir = @includedir@
+infodir = @infodir@
+install_sh = @install_sh@
+libdir = @libdir@
+libexecdir = @libexecdir@
+localedir = @localedir@
+localstatedir = @localstatedir@
+mandir = @mandir@
+mkdir_p = @mkdir_p@
+oldincludedir = @oldincludedir@
+pdfdir = @pdfdir@
+prefix = @prefix@
+program_transform_name = @program_transform_name@
+psdir = @psdir@
+runstatedir = @runstatedir@
+sbindir = @sbindir@
+sharedstatedir = @sharedstatedir@
+srcdir = @srcdir@
+sysconfdir = @sysconfdir@
+target_alias = @target_alias@
+top_build_prefix = @top_build_prefix@
+top_builddir = @top_builddir@
+top_srcdir = @top_srcdir@
+AM_CFLAGS = -I../include -O2 -std=c99 -Wall
+knn_SOURCES = knn.c knntree.c knntree.h \
+../utils/utils.c ../utils/iltree.c \
+../include/utils.h ../include/iltree.h
+
+knn_LDADD = -lm
+knn_w_SOURCES = knn_w.c knntree.c knntree.h \
+../utils/utils.c ../utils/iltree.c \
+../include/utils.h ../include/iltree.h
+
+knn_w_LDADD = -lm
+all: all-am
+
+.SUFFIXES:
+.SUFFIXES: .c .o .obj
+$(srcdir)/Makefile.in: $(srcdir)/Makefile.am $(srcdir)/../common.mk $(am__configure_deps)
+ @for dep in $?; do \
+ case '$(am__configure_deps)' in \
+ *$$dep*) \
+ ( cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh ) \
+ && { if test -f $@; then exit 0; else break; fi; }; \
+ exit 1;; \
+ esac; \
+ done; \
+ echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/knn/Makefile'; \
+ $(am__cd) $(top_srcdir) && \
+ $(AUTOMAKE) --foreign src/knn/Makefile
+Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
+ @case '$?' in \
+ *config.status*) \
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh;; \
+ *) \
+ echo ' cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe)'; \
+ cd $(top_builddir) && $(SHELL) ./config.status $(subdir)/$@ $(am__depfiles_maybe);; \
+ esac;
+$(srcdir)/../common.mk $(am__empty):
+
+$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+
+$(top_srcdir)/configure: $(am__configure_deps)
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+$(ACLOCAL_M4): $(am__aclocal_m4_deps)
+ cd $(top_builddir) && $(MAKE) $(AM_MAKEFLAGS) am--refresh
+$(am__aclocal_m4_deps):
+install-binPROGRAMS: $(bin_PROGRAMS)
+ @$(NORMAL_INSTALL)
+ @list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
+ if test -n "$$list"; then \
+ echo " $(MKDIR_P) '$(DESTDIR)$(bindir)'"; \
+ $(MKDIR_P) "$(DESTDIR)$(bindir)" || exit 1; \
+ fi; \
+ for p in $$list; do echo "$$p $$p"; done | \
+ sed 's/$(EXEEXT)$$//' | \
+ while read p p1; do if test -f $$p \
+ ; then echo "$$p"; echo "$$p"; else :; fi; \
+ done | \
+ sed -e 'p;s,.*/,,;n;h' \
+ -e 's|.*|.|' \
+ -e 'p;x;s,.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/' | \
+ sed 'N;N;N;s,\n, ,g' | \
+ $(AWK) 'BEGIN { files["."] = ""; dirs["."] = 1 } \
+ { d=$$3; if (dirs[d] != 1) { print "d", d; dirs[d] = 1 } \
+ if ($$2 == $$4) files[d] = files[d] " " $$1; \
+ else { print "f", $$3 "/" $$4, $$1; } } \
+ END { for (d in files) print "f", d, files[d] }' | \
+ while read type dir files; do \
+ if test "$$dir" = .; then dir=; else dir=/$$dir; fi; \
+ test -z "$$files" || { \
+ echo " $(INSTALL_PROGRAM_ENV) $(INSTALL_PROGRAM) $$files '$(DESTDIR)$(bindir)$$dir'"; \
+ $(INSTALL_PROGRAM_ENV) $(INSTALL_PROGRAM) $$files "$(DESTDIR)$(bindir)$$dir" || exit $$?; \
+ } \
+ ; done
+
+uninstall-binPROGRAMS:
+ @$(NORMAL_UNINSTALL)
+ @list='$(bin_PROGRAMS)'; test -n "$(bindir)" || list=; \
+ files=`for p in $$list; do echo "$$p"; done | \
+ sed -e 'h;s,^.*/,,;s/$(EXEEXT)$$//;$(transform)' \
+ -e 's/$$/$(EXEEXT)/' \
+ `; \
+ test -n "$$list" || exit 0; \
+ echo " ( cd '$(DESTDIR)$(bindir)' && rm -f" $$files ")"; \
+ cd "$(DESTDIR)$(bindir)" && rm -f $$files
+
+clean-binPROGRAMS:
+ -test -z "$(bin_PROGRAMS)" || rm -f $(bin_PROGRAMS)
+../utils/$(am__dirstamp):
+ @$(MKDIR_P) ../utils
+ @: > ../utils/$(am__dirstamp)
+../utils/$(DEPDIR)/$(am__dirstamp):
+ @$(MKDIR_P) ../utils/$(DEPDIR)
+ @: > ../utils/$(DEPDIR)/$(am__dirstamp)
+../utils/utils.$(OBJEXT): ../utils/$(am__dirstamp) \
+ ../utils/$(DEPDIR)/$(am__dirstamp)
+../utils/iltree.$(OBJEXT): ../utils/$(am__dirstamp) \
+ ../utils/$(DEPDIR)/$(am__dirstamp)
+
+knn$(EXEEXT): $(knn_OBJECTS) $(knn_DEPENDENCIES) $(EXTRA_knn_DEPENDENCIES)
+ @rm -f knn$(EXEEXT)
+ $(AM_V_CCLD)$(LINK) $(knn_OBJECTS) $(knn_LDADD) $(LIBS)
+
+knn_w$(EXEEXT): $(knn_w_OBJECTS) $(knn_w_DEPENDENCIES) $(EXTRA_knn_w_DEPENDENCIES)
+ @rm -f knn_w$(EXEEXT)
+ $(AM_V_CCLD)$(LINK) $(knn_w_OBJECTS) $(knn_w_LDADD) $(LIBS)
+
+mostlyclean-compile:
+ -rm -f *.$(OBJEXT)
+ -rm -f ../utils/*.$(OBJEXT)
+
+distclean-compile:
+ -rm -f *.tab.c
+
+@AMDEP_TRUE@@am__include@ @am__quote@../utils/$(DEPDIR)/iltree.Po@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@../utils/$(DEPDIR)/utils.Po@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/knn.Po@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/knn_w.Po@am__quote@
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/knntree.Po@am__quote@
+
+.c.o:
+@am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.o$$||'`;\
+@am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ $< &&\
+@am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po
+@AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c -o $@ $<
+
+.c.obj:
+@am__fastdepCC_TRUE@ $(AM_V_CC)depbase=`echo $@ | sed 's|[^/]*$$|$(DEPDIR)/&|;s|\.obj$$||'`;\
+@am__fastdepCC_TRUE@ $(COMPILE) -MT $@ -MD -MP -MF $$depbase.Tpo -c -o $@ `$(CYGPATH_W) '$<'` &&\
+@am__fastdepCC_TRUE@ $(am__mv) $$depbase.Tpo $$depbase.Po
+@AMDEP_TRUE@@am__fastdepCC_FALSE@ $(AM_V_CC)source='$<' object='$@' libtool=no @AMDEPBACKSLASH@
+@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@
+@am__fastdepCC_FALSE@ $(AM_V_CC@am__nodep@)$(COMPILE) -c -o $@ `$(CYGPATH_W) '$<'`
+
+ID: $(am__tagged_files)
+ $(am__define_uniq_tagged_files); mkid -fID $$unique
+tags: tags-am
+TAGS: tags
+
+tags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)
+ set x; \
+ here=`pwd`; \
+ $(am__define_uniq_tagged_files); \
+ shift; \
+ if test -z "$(ETAGS_ARGS)$$*$$unique"; then :; else \
+ test -n "$$unique" || unique=$$empty_fix; \
+ if test $$# -gt 0; then \
+ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
+ "$$@" $$unique; \
+ else \
+ $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
+ $$unique; \
+ fi; \
+ fi
+ctags: ctags-am
+
+CTAGS: ctags
+ctags-am: $(TAGS_DEPENDENCIES) $(am__tagged_files)
+ $(am__define_uniq_tagged_files); \
+ test -z "$(CTAGS_ARGS)$$unique" \
+ || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
+ $$unique
+
+GTAGS:
+ here=`$(am__cd) $(top_builddir) && pwd` \
+ && $(am__cd) $(top_srcdir) \
+ && gtags -i $(GTAGS_ARGS) "$$here"
+cscopelist: cscopelist-am
+
+cscopelist-am: $(am__tagged_files)
+ list='$(am__tagged_files)'; \
+ case "$(srcdir)" in \
+ [\\/]* | ?:[\\/]*) sdir="$(srcdir)" ;; \
+ *) sdir=$(subdir)/$(srcdir) ;; \
+ esac; \
+ for i in $$list; do \
+ if test -f "$$i"; then \
+ echo "$(subdir)/$$i"; \
+ else \
+ echo "$$sdir/$$i"; \
+ fi; \
+ done >> $(top_builddir)/cscope.files
+
+distclean-tags:
+ -rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
+
+distdir: $(DISTFILES)
+ @srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+ topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+ list='$(DISTFILES)'; \
+ dist_files=`for file in $$list; do echo $$file; done | \
+ sed -e "s|^$$srcdirstrip/||;t" \
+ -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
+ case $$dist_files in \
+ */*) $(MKDIR_P) `echo "$$dist_files" | \
+ sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
+ sort -u` ;; \
+ esac; \
+ for file in $$dist_files; do \
+ if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
+ if test -d $$d/$$file; then \
+ dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
+ if test -d "$(distdir)/$$file"; then \
+ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+ fi; \
+ if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
+ cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
+ find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+ fi; \
+ cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
+ else \
+ test -f "$(distdir)/$$file" \
+ || cp -p $$d/$$file "$(distdir)/$$file" \
+ || exit 1; \
+ fi; \
+ done
+check-am: all-am
+check: check-am
+all-am: Makefile $(PROGRAMS)
+installdirs:
+ for dir in "$(DESTDIR)$(bindir)"; do \
+ test -z "$$dir" || $(MKDIR_P) "$$dir"; \
+ done
+install: install-am
+install-exec: install-exec-am
+install-data: install-data-am
+uninstall: uninstall-am
+
+install-am: all-am
+ @$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-am
+install-strip:
+ if test -z '$(STRIP)'; then \
+ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+ install; \
+ else \
+ $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+ install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+ "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
+ fi
+mostlyclean-generic:
+
+clean-generic:
+
+distclean-generic:
+ -test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
+ -test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
+ -rm -f ../utils/$(DEPDIR)/$(am__dirstamp)
+ -rm -f ../utils/$(am__dirstamp)
+
+maintainer-clean-generic:
+ @echo "This command is intended for maintainers to use"
+ @echo "it deletes files that may require special tools to rebuild."
+clean: clean-am
+
+clean-am: clean-binPROGRAMS clean-generic mostlyclean-am
+
+distclean: distclean-am
+ -rm -rf ../utils/$(DEPDIR) ./$(DEPDIR)
+ -rm -f Makefile
+distclean-am: clean-am distclean-compile distclean-generic \
+ distclean-tags
+
+dvi: dvi-am
+
+dvi-am:
+
+html: html-am
+
+html-am:
+
+info: info-am
+
+info-am:
+
+install-data-am:
+
+install-dvi: install-dvi-am
+
+install-dvi-am:
+
+install-exec-am: install-binPROGRAMS
+
+install-html: install-html-am
+
+install-html-am:
+
+install-info: install-info-am
+
+install-info-am:
+
+install-man:
+
+install-pdf: install-pdf-am
+
+install-pdf-am:
+
+install-ps: install-ps-am
+
+install-ps-am:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-am
+ -rm -rf ../utils/$(DEPDIR) ./$(DEPDIR)
+ -rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-compile mostlyclean-generic
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am: uninstall-binPROGRAMS
+
+.MAKE: install-am install-strip
+
+.PHONY: CTAGS GTAGS TAGS all all-am check check-am clean \
+ clean-binPROGRAMS clean-generic cscopelist-am ctags ctags-am \
+ distclean distclean-compile distclean-generic distclean-tags \
+ distdir dvi dvi-am html html-am info info-am install \
+ install-am install-binPROGRAMS install-data install-data-am \
+ install-dvi install-dvi-am install-exec install-exec-am \
+ install-html install-html-am install-info install-info-am \
+ install-man install-pdf install-pdf-am install-ps \
+ install-ps-am install-strip installcheck installcheck-am \
+ installdirs maintainer-clean maintainer-clean-generic \
+ mostlyclean mostlyclean-compile mostlyclean-generic pdf pdf-am \
+ ps ps-am tags tags-am uninstall uninstall-am \
+ uninstall-binPROGRAMS
+
+.PRECIOUS: Makefile
+
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
diff --git a/src/knn/knn.c b/src/knn/knn.c
new file mode 100644
index 0000000..a79486f
--- /dev/null
+++ b/src/knn/knn.c
@@ -0,0 +1,349 @@
+/**
+ * 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
+ *
+ ***********************************************************************
+ *
+ * Compute knn(k) for a given unweighted graph. If requested, the
+ * average is computed for ranges of degrees falling into a number of
+ * equal bins or into bins or exponentially increasing width.
+ *
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <string.h>
+
+#include "utils.h"
+#include "knntree.h"
+
+#define NO_BIN 0x01
+#define BIN_LIN 0x02
+#define BIN_EXP 0x04
+
+void usage(char *argv[]){
+
+ printf("********************************************************************\n"
+ "** **\n"
+ "** -*- knn -*- **\n"
+ "** **\n"
+ "** Compute the average nearest-neighbour degree function knn(k) **\n"
+ "** of the unweighted graph provided as input. **\n"
+ "** **\n"
+ "** The input file 'graph_in' is an edge-list: **\n"
+ "** **\n"
+ "** I_1 J_1 **\n"
+ "** I_2 J_2 **\n"
+ "** I_3 J_3 **\n"
+ "** ... ... **\n"
+ "** I_K J_K **\n"
+ "** **\n"
+ "** If 'graph_in' is equal to '-' (dash), read the file from **\n"
+ "** the standard input (STDIN). **\n"
+ "** **\n"
+ "** If no second parameter is given (or the second parameter **\n"
+ "** is equal to 'NO'), the program prints on output the value **\n"
+ "** of knn(k) for each degree in the graph, in the format: **\n"
+ "** **\n"
+ "** k1 knn(k1) **\n"
+ "** k2 knn(k2) **\n"
+ "** ..... **\n"
+ "** **\n"
+ "** If the second parameter is 'LIN', the values of knn(k) **\n"
+ "** will be grouped into 'bin_param' equal bins. **\n"
+ "** **\n"
+ "** If the second parameter is 'EXP;, the values of knn(k) **\n"
+ "** will be grouped into bins whose width increases **\n"
+ "** exponentially with exponent 'bin_param' (also known as **\n"
+ "** 'logarithmic binning'). **\n"
+ "** **\n"
+ "********************************************************************\n"
+ " This is Free Software - You can use and distribute it under \n"
+ " the terms of the GNU General Public License, version 3 or later\n\n"
+ " Please visit http://www.complex-networks.net for more information\n\n"
+ " (c) Vincenzo Nicosia 2010-2017 (v.nicosia@qmul.ac.uk)\n"
+ "********************************************************************\n\n"
+ );
+ printf("Usage: %s <graph_in> [<NO|LIN|EXP> <bin_param>]\n", argv[0]);
+}
+
+
+
+typedef struct{
+ unsigned int num_bins;
+ unsigned int *degs;
+ unsigned int *num;
+ double *values;
+} knn_hist_t;
+
+
+/* compute the sum of the degrees of the neighbours of the node with
+ label 'idx' */
+double neigh_degs_sum(unsigned int *J_slap, unsigned int *r_slap, unsigned int idx){
+
+ double sum = 0;
+ unsigned j, k;
+
+ for(j=r_slap[idx]; j < r_slap[idx+1]; j++){
+ k = J_slap[j];
+ sum += r_slap[k+1] - r_slap[k];
+ }
+ return sum;
+}
+
+/* compute knn(k) for each degree k */
+void compute_knn(unsigned int *J_slap, unsigned int *r_slap, unsigned int N,
+ knntree_t t){
+
+ knnsum_t elem, *ptr;
+ unsigned int i;
+
+ for(i=0; i<N; i++){
+ elem.k = r_slap[i+1] - r_slap[i];
+ elem.knnsum = neigh_degs_sum(J_slap, r_slap, i);
+ ptr = iltree_lookup(t, &elem);
+ if (!ptr){
+ elem.Nk = 1;
+ iltree_insert(t, &elem);
+ }
+ else{
+ ptr->Nk +=1;
+ ptr->knnsum += elem.knnsum;
+ }
+ }
+}
+
+/* aggregate all the values of knn(k) for the degrees falling in a
+ certain bin */
+void aggregate_knn(void *elem, void *h){
+
+ knn_hist_t *hist;
+ knnsum_t *s;
+ unsigned int cur, low, high;
+
+ hist = (knn_hist_t*)h;
+ s = (knnsum_t*)elem;
+
+
+ cur = hist->num_bins / 2;
+
+ low = 0;
+ high = hist->num_bins - 1;
+
+ while (low < high){
+ if (hist->degs[cur] < s->k){
+ low = cur+1;
+ }
+ else if(hist->degs[cur] >= s->k){
+ high = cur;
+ }
+ cur = (high + low) / 2;
+ }
+
+ hist->num[cur] += s->Nk * s->k;
+ hist->values[cur] += s->knnsum;
+}
+
+
+/* print knn(k) for each value of k in the graph (i.e., without any
+ binning) */
+void print_knn_nobin(knntree_t t){
+
+ iltree_view_pre(t);
+}
+
+
+
+/* print the values of knn(k) averaging over num_bins of equal size */
+void print_knn_lin(knntree_t t, unsigned int num_bins){
+
+ unsigned int kmin, kmax, step, i;
+ knn_hist_t hist;
+
+ if (!t){
+ return;
+ }
+
+
+ kmin = ((knnsum_t*)iltree_getmin(t))->k;
+ kmax = ((knnsum_t*)iltree_getmax(t))->k;
+
+ hist.num_bins = num_bins;
+
+ step = (kmax - kmin)/num_bins + 1;
+
+ hist.degs = malloc(num_bins * sizeof(unsigned int));
+ hist.num = malloc(num_bins * sizeof(unsigned int));
+ hist.values = malloc(num_bins * sizeof(double));
+
+
+ hist.degs[0] = kmin + step;
+ hist.values[0] = 0;
+ hist.num[0] = 0;
+
+ for(i=1; i<num_bins; i++){
+ hist.degs[i] = hist.degs[i-1] + step;
+ hist.values[i] = 0;
+ hist.num[i] = 0;
+ }
+
+ iltree_map_args(t, aggregate_knn, &hist);
+
+ for(i=0; i<hist.num_bins; i++){
+ if (hist.num[i])
+ printf("%d %2.8g\n", hist.degs[i], hist.values[i] / hist.num[i] );
+ }
+
+ free(hist.degs);
+ free(hist.num);
+ free(hist.values);
+
+}
+
+
+/* print knn(k) using exponential (a.k.a. logarithmic) binning */
+
+void print_knn_exp(knntree_t t, double alpha){
+
+ unsigned int kmin, kmax, i;
+ double width;
+ knn_hist_t hist;
+
+ if (!t){
+ return;
+ }
+
+
+ kmin = ((knnsum_t*)iltree_getmin(t))->k;
+ kmax = ((knnsum_t*)iltree_getmax(t))->k;
+
+
+ hist.num_bins = (int)ceil(log(kmax)/log(alpha)) + 1;
+
+
+ hist.degs = malloc(hist.num_bins * sizeof(unsigned int));
+ hist.num = malloc(hist.num_bins * sizeof(unsigned int));
+ hist.values = malloc(hist.num_bins * sizeof(double));
+
+ width = 2;
+
+ hist.degs[0] = kmin + width;
+ hist.values[0] = 0;
+ hist.num[0] = 0;
+
+ for(i=1; i<hist.num_bins; i++){
+ hist.values[i] = 0;
+ hist.num[i] = 0;
+ width *= alpha;
+ hist.degs[i] = (int)ceil(hist.degs[i-1] + width);
+ }
+
+ iltree_map_args(t, aggregate_knn, &hist);
+
+ for(i=0; i<hist.num_bins; i++){
+ if(hist.num[i])
+ printf("%d %2.8g\n", hist.degs[i], hist.values[i] / hist.num[i] );
+ }
+
+ free(hist.degs);
+ free(hist.num);
+ free(hist.values);
+
+}
+
+
+
+int main(int argc, char *argv[]){
+
+ unsigned int N, K;
+ unsigned int *J_slap=NULL, *r_slap=NULL;
+ FILE *filein;
+ char bin_type;
+ unsigned int num_bins;
+ double alpha;
+ knntree_t t = NULL;
+
+
+
+ if(argc < 2){
+ usage(argv);
+ exit(1);
+ }
+
+ if(!strcmp(argv[1], "-")){
+ filein = stdin;
+ }
+ else{
+ filein = openfile_or_exit(argv[1], "r", 2);
+ }
+
+ t = iltree_create(t);
+
+ bin_type = NO_BIN;
+ if (argc > 2){ /* the user has specified a binning type */
+ if (!my_strcasecmp(argv[2], "lin")){
+ bin_type = BIN_LIN;
+ if(argc < 4){
+ fprintf(stderr, "you must provide a number of bins for linear binning\n");
+ exit(3);
+ }
+ num_bins = atoi(argv[3]);
+ }
+ else if (!my_strcasecmp(argv[2], "exp")){
+ bin_type = BIN_EXP;
+ if(argc < 4){
+ fprintf(stderr, "you must provide an exponent for exponential binning\n");
+ exit(4);
+ }
+ alpha = atof(argv[3]);
+ }
+ }
+
+ read_slap(filein, &K, &N, &J_slap, &r_slap);
+ fclose(filein);
+
+ t = knntree_init(t, stdout);
+ compute_knn(J_slap, r_slap, N, t);
+
+
+ switch(bin_type){
+ case BIN_LIN:
+ print_knn_lin(t, num_bins);
+ break;
+ case BIN_EXP:
+ print_knn_exp(t, alpha);
+ break;
+ default:
+ print_knn_nobin(t);
+ break;
+ }
+ iltree_destroy(t);
+ free(J_slap);
+ free(r_slap);
+}
diff --git a/src/knn/knn_w.c b/src/knn/knn_w.c
new file mode 100644
index 0000000..53c2671
--- /dev/null
+++ b/src/knn/knn_w.c
@@ -0,0 +1,355 @@
+/**
+ * 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
+ *
+ ***********************************************************************
+ *
+ * Compute knn(k) for a given weighted graph. If requested, the
+ * average is computed for ranges of degrees falling into bins of
+ * exponentially increasing width.
+ *
+ * References:
+ *
+ * [1] A. Barrat et al. "The architecture of complex weighted
+ * networks". P. Natl. Acad. Sci USA 101 (2004), 3747-3752.
+ *
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+#include <string.h>
+
+#include "utils.h"
+#include "knntree.h"
+
+#define NO_BIN 0x01
+#define BIN_LIN 0x02
+#define BIN_EXP 0x04
+
+void usage(char *argv[]){
+ printf("********************************************************************\n"
+ "** **\n"
+ "** -*- knn_w -*- **\n"
+ "** **\n"
+ "** Compute the average nearest-neighbour degree function knn(k) **\n"
+ "** of the weighted graph provided as input. **\n"
+ "** **\n"
+ "** The input file 'graph_in' is an edge-list: **\n"
+ "** **\n"
+ "** I_1 J_1 W_1 **\n"
+ "** I_2 J_2 W_2 **\n"
+ "** I_3 J_3 W_3 **\n"
+ "** ... ... **\n"
+ "** I_K J_K W_K **\n"
+ "** **\n"
+ "** If 'graph_in' is equal to '-' (dash), read the file from **\n"
+ "** the standard input (STDIN). **\n"
+ "** **\n"
+ "** If no second parameter is given (or the second parameter **\n"
+ "** is equal to 'NO'), the program prints on output the value **\n"
+ "** of knn_w(k) for each degree in the graph, in the format: **\n"
+ "** **\n"
+ "** k1 knn_w(k1) **\n"
+ "** k2 knn_w(k2) **\n"
+ "** ..... **\n"
+ "** **\n"
+ "** If the second parameter is 'LIN', the values of knn_w(k) **\n"
+ "** will be grouped into 'bin_param' equal bins. **\n"
+ "** **\n"
+ "** If the second parameter is 'EXP;, the values of knn_w(k) **\n"
+ "** will be grouped into bins whose width increases **\n"
+ "** exponentially with exponent 'bin_param' (also known as **\n"
+ "** 'logarithmic binning'). **\n"
+ "** **\n"
+ "********************************************************************\n"
+ " This is Free Software - You can use and distribute it under \n"
+ " the terms of the GNU General Public License, version 3 or later\n\n"
+ " Please visit http://www.complex-networks.net for more information\n\n"
+ " (c) Vincenzo Nicosia 2010-2017 (v.nicosia@qmul.ac.uk)\n"
+ "********************************************************************\n\n"
+ );
+ printf("Usage: %s <graph_in> [<NO|LIN|EXP> <bin_param>]\n", argv[0]);
+}
+
+
+
+typedef struct{
+ unsigned int num_bins;
+ unsigned int *degs;
+ double *num;
+ double *values;
+} knn_hist_t;
+
+
+double neigh_degs_wsum(unsigned int *J_slap, unsigned int *r_slap, double *W_slap,
+ unsigned int idx){
+
+ double sum = 0;
+ unsigned j, k;
+
+ for(j=r_slap[idx]; j < r_slap[idx+1]; j++){
+ k = J_slap[j];
+ sum += W_slap[j] * (r_slap[k+1] - r_slap[k]);
+ }
+ return sum;
+}
+
+
+
+void compute_knn_w(unsigned int *J_slap, unsigned int *r_slap, double *W_slap,
+ unsigned int N, knntree_t t){
+
+ knnsum_t elem, *ptr;
+ unsigned int i;
+
+ for(i=0; i<N; i++){
+ elem.k = r_slap[i+1] - r_slap[i];
+ elem.knnsum = 1.0 * neigh_degs_wsum(J_slap, r_slap, W_slap, i) / strength(r_slap, W_slap, i);
+ ptr = iltree_lookup(t, &elem);
+ if (!ptr){
+ elem.Nk = 1;
+ iltree_insert(t, &elem);
+ }
+ else{
+ ptr->Nk +=1;
+ ptr->knnsum += elem.knnsum;
+ }
+ }
+}
+
+
+void aggregate_knn(void *elem, void *h){
+
+ knn_hist_t *hist;
+ knnsum_t *s;
+ unsigned int cur, low, high;
+
+ hist = (knn_hist_t*)h;
+ s = (knnsum_t*)elem;
+
+ cur = hist->num_bins / 2;
+
+ low = 0;
+ high = hist->num_bins - 1;
+
+ while (low < high){
+ if (hist->degs[cur] < s->k){
+ low = cur+1;
+ }
+ else if(hist->degs[cur] >= s->k){
+ high = cur;
+ }
+ cur = (high + low) / 2;
+ }
+
+
+ hist->num[cur] += s->Nk;
+ hist->values[cur] += s->knnsum;
+}
+
+
+void print_knn_nobin(knntree_t t){
+
+ iltree_view_pre(t);
+}
+
+
+
+
+void print_knn_lin(knntree_t t, unsigned int num_bins){
+
+ unsigned int kmin, kmax, step, i;
+ knn_hist_t hist;
+
+ if (!t){
+ return;
+ }
+
+
+ kmin = ((knnsum_t*)iltree_getmin(t))->k;
+ kmax = ((knnsum_t*)iltree_getmax(t))->k;
+
+ hist.num_bins = num_bins;
+
+ step = (kmax - kmin)/num_bins + 1;
+
+ hist.degs = malloc(num_bins * sizeof(unsigned int));
+ hist.num = malloc(num_bins * sizeof(double));
+ hist.values = malloc(num_bins * sizeof(double));
+
+
+ hist.degs[0] = kmin + step;
+ hist.values[0] = 0;
+ hist.num[0] = 0;
+
+ for(i=1; i<num_bins; i++){
+ hist.degs[i] = hist.degs[i-1] + step;
+ hist.values[i] = 0;
+ hist.num[i] = 0;
+ }
+
+ iltree_map_args(t, aggregate_knn, &hist);
+
+ for(i=0; i<hist.num_bins; i++){
+ if (hist.num[i])
+ printf("%d %2.8g\n", hist.degs[i], hist.values[i] / hist.num[i] );
+ }
+
+ free(hist.degs);
+ free(hist.num);
+ free(hist.values);
+
+}
+
+
+
+void print_knn_exp(knntree_t t, double alpha){
+
+ unsigned int kmin, kmax, i;
+ double width;
+ knn_hist_t hist;
+
+ if (!t){
+ return;
+ }
+
+
+ kmin = ((knnsum_t*)iltree_getmin(t))->k;
+ kmax = ((knnsum_t*)iltree_getmax(t))->k;
+
+
+ hist.num_bins = (int)ceil(log(kmax)/log(alpha)) + 1;
+
+
+ hist.degs = malloc(hist.num_bins * sizeof(unsigned int));
+ hist.num = malloc(hist.num_bins * sizeof(double));
+ hist.values = malloc(hist.num_bins * sizeof(double));
+
+ width = 2;
+
+ hist.degs[0] = kmin + width;
+ hist.values[0] = 0;
+ hist.num[0] = 0;
+
+ for(i=1; i<hist.num_bins; i++){
+ hist.values[i] = 0;
+ hist.num[i] = 0;
+ width *= alpha;
+ hist.degs[i] = (int)ceil(hist.degs[i-1] + width);
+ }
+
+ iltree_map_args(t, aggregate_knn, &hist);
+
+ for(i=0; i<hist.num_bins; i++){
+ if(hist.num[i])
+ printf("%d %2.8g\n", hist.degs[i], hist.values[i] / hist.num[i] );
+ }
+
+ free(hist.degs);
+ free(hist.num);
+ free(hist.values);
+
+}
+
+
+
+
+
+int main(int argc, char *argv[]){
+
+ unsigned int N, K;
+ unsigned int *J_slap=NULL, *r_slap=NULL;
+ double *W_slap = NULL;
+ FILE *filein;
+ char bin_type;
+ unsigned int num_bins;
+ double alpha;
+ knntree_t t = NULL;
+
+
+
+ if(argc < 2){
+ usage(argv);
+ exit(1);
+ }
+
+ if(!strcmp(argv[1], "-")){
+ filein = stdin;
+ }
+ else{
+ filein = openfile_or_exit(argv[1], "r", 2);
+ }
+
+ t = iltree_create(t);
+
+ bin_type = NO_BIN;
+ if (argc > 2){ /* the user has specified a binning type */
+ if (!my_strcasecmp(argv[2], "lin")){
+ bin_type = BIN_LIN;
+ if(argc < 4){
+ fprintf(stderr, "you must provide a number of bins for linear binning\n");
+ exit(3);
+ }
+ num_bins = atoi(argv[3]);
+ }
+ else if (!my_strcasecmp(argv[2], "exp")){
+ bin_type = BIN_EXP;
+ if(argc < 4){
+ fprintf(stderr, "you must provide an exponent for exponential binning\n");
+ exit(4);
+ }
+ alpha = atof(argv[3]);
+ }
+ }
+
+ read_slap_w(filein, &K, &N, &J_slap, &r_slap, &W_slap);
+
+ fclose(filein);
+
+ t = knntree_init(t, stdout);
+ compute_knn_w(J_slap, r_slap, W_slap, N, t);
+
+
+ switch(bin_type){
+ case BIN_LIN:
+ print_knn_lin(t, num_bins);
+ break;
+ case BIN_EXP:
+ print_knn_exp(t, alpha);
+ break;
+ default:
+ print_knn_nobin(t);
+ break;
+ }
+ iltree_destroy(t);
+ free(J_slap);
+ free(r_slap);
+ free(W_slap);
+}
+
diff --git a/src/knn/knntree.c b/src/knn/knntree.c
new file mode 100644
index 0000000..edcbfcc
--- /dev/null
+++ b/src/knn/knntree.c
@@ -0,0 +1,95 @@
+/**
+ * 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.
+ *
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "knntree.h"
+
+
+void* __alloc_knnsum(){
+ knnsum_t *t;
+
+ t = malloc(sizeof(knnsum_t));
+ return t;
+}
+
+void __dealloc_knnsum(void *elem){
+
+ free(elem);
+
+}
+
+void __copy_knnsum(void *elem1, void *elem2){
+ *((knnsum_t*)elem2) = *((knnsum_t*)elem1);
+}
+
+int __compare_knnsum(void *elem1, void *elem2){
+
+ knnsum_t *t1, *t2;
+
+ t1 = (knnsum_t*)elem1;
+ t2 = (knnsum_t*)elem2;
+
+ return (t1->k < t2->k ? -1 : (t1->k > t2->k ? 1 : 0));
+}
+
+void __print_knnsum(void *elem, void *fileout){
+
+ knnsum_t *t;
+
+ t = (knnsum_t*)elem;
+
+ fprintf((FILE*)fileout, "%d %2.8g\n", t->k, t->knnsum / (t->k * t->Nk));
+}
+
+
+knntree_t knntree_init(knntree_t t, void *fileout){
+
+ ilfunc_t funs= {
+ .alloc = __alloc_knnsum,
+ .dealloc = __dealloc_knnsum,
+ .copy = __copy_knnsum,
+ .compare = __compare_knnsum,
+ .print = __print_knnsum,
+ .fileout = fileout
+ };
+
+ t = iltree_create((iltree_t)t);
+ iltree_set_funs((iltree_t)t, &funs);
+ return t;
+}
+
+
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__
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-25 22:49:49 +0000