diff options
Diffstat (limited to 'src/betweenness')
| -rw-r--r-- | src/betweenness/Makefile.am | 7 | ||||
| -rw-r--r-- | src/betweenness/Makefile.in | 590 | ||||
| -rw-r--r-- | src/betweenness/README | 8 | ||||
| -rw-r--r-- | src/betweenness/bet_dependency.c | 224 | ||||
| -rw-r--r-- | src/betweenness/betweenness.c | 316 |
5 files changed, 1145 insertions, 0 deletions
diff --git a/src/betweenness/Makefile.am b/src/betweenness/Makefile.am new file mode 100644 index 0000000..6adf93f --- /dev/null +++ b/src/betweenness/Makefile.am @@ -0,0 +1,7 @@ +include ../common.mk +bin_PROGRAMS = betweenness bet_dependency +betweenness_SOURCES = betweenness.c ../utils/utils.c ../include/utils.h +betweenness_LDADD = -lm +bet_dependency_SOURCES = bet_dependency.c ../utils/utils.c ../include/utils.h +bet_dependency_LDADD = -lm + diff --git a/src/betweenness/Makefile.in b/src/betweenness/Makefile.in new file mode 100644 index 0000000..776f7a1 --- /dev/null +++ b/src/betweenness/Makefile.in @@ -0,0 +1,590 @@ +# 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 = betweenness$(EXEEXT) bet_dependency$(EXEEXT) +subdir = src/betweenness +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_bet_dependency_OBJECTS = bet_dependency.$(OBJEXT) \ + ../utils/utils.$(OBJEXT) +bet_dependency_OBJECTS = $(am_bet_dependency_OBJECTS) +bet_dependency_DEPENDENCIES = +am_betweenness_OBJECTS = betweenness.$(OBJEXT) \ + ../utils/utils.$(OBJEXT) +betweenness_OBJECTS = $(am_betweenness_OBJECTS) +betweenness_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 = $(bet_dependency_SOURCES) $(betweenness_SOURCES) +DIST_SOURCES = $(bet_dependency_SOURCES) $(betweenness_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 README +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 +betweenness_SOURCES = betweenness.c ../utils/utils.c ../include/utils.h +betweenness_LDADD = -lm +bet_dependency_SOURCES = bet_dependency.c ../utils/utils.c ../include/utils.h +bet_dependency_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/betweenness/Makefile'; \ + $(am__cd) $(top_srcdir) && \ + $(AUTOMAKE) --foreign src/betweenness/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) + +bet_dependency$(EXEEXT): $(bet_dependency_OBJECTS) $(bet_dependency_DEPENDENCIES) $(EXTRA_bet_dependency_DEPENDENCIES) + @rm -f bet_dependency$(EXEEXT) + $(AM_V_CCLD)$(LINK) $(bet_dependency_OBJECTS) $(bet_dependency_LDADD) $(LIBS) + +betweenness$(EXEEXT): $(betweenness_OBJECTS) $(betweenness_DEPENDENCIES) $(EXTRA_betweenness_DEPENDENCIES) + @rm -f betweenness$(EXEEXT) + $(AM_V_CCLD)$(LINK) $(betweenness_OBJECTS) $(betweenness_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)/utils.Po@am__quote@ +@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/bet_dependency.Po@am__quote@ +@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/betweenness.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/betweenness/README b/src/betweenness/README new file mode 100644 index 0000000..c41e3d1 --- /dev/null +++ b/src/betweenness/README @@ -0,0 +1,8 @@ +- bet_dependency computes the contribution to betweenness of each node in the graph + restricted to shortest paths originating from a range of nodes + + --- TODO --- + +- make a multi-threaded version +- make an MPI implementation +- make a version which considers only X% of the nodes, sampled at random diff --git a/src/betweenness/bet_dependency.c b/src/betweenness/bet_dependency.c new file mode 100644 index 0000000..2b55543 --- /dev/null +++ b/src/betweenness/bet_dependency.c @@ -0,0 +1,224 @@ +/** + * 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 + * + *********************************************************************** + * + * This program computes the betweenness dependency of all the nodes + * of a graph, using Brandes' algorithm, and counting all the + * shortest paths originating from a set of nodes (potentially the + * whole set of vertices). + * + * References: + * U. Brandes. "A Faster Algorithm for Betweenness + * Centrality". J. Math. Sociol. 25 (2001), 163-177. + * + */ + + +#include <stdio.h> +#include <stdlib.h> +#include <string.h> + +#include "utils.h" + + +void usage(char *argv[]){ + printf("********************************************************************\n" + "** **\n" + "** -*- bet_dependency -*- **\n" + "** **\n" + "** Compute the betweenness dependency of all the nodes of a **\n" + "** network due to the shortest paths originating from a set **\n" + "** of initial nodes. If no start node is specified, compute **\n" + "** the dependency due to all the nodes of the graph. If no end **\n" + "** node is specified, compute the dependency due to the nodes **\n" + "** between node_start and the last node of the graph. **\n" + "** **\n" + "** The dependency of each node is printed on standard output. **\n" + "** **\n" + "** **\n" + "********************************************************************\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" + " (c) Vincenzo Nicosia 2009-2017 (katolaz@yahoo.it)\n\n"); + printf("Usage: %s <graph_in> [<node_start> [<node_end>]]\n\n" , argv[0]); +} + +void add_predecessor(unsigned int **pred, unsigned int k){ + + (*pred)[0] += 1; + *pred = realloc(*pred, ((*pred)[0] + 1) * sizeof(unsigned int)); + (*pred)[ (*pred)[0] ] = k; +} + + + +/* + * Returns a list of dependencies + */ +double* compute_bet_dependency(unsigned int N, unsigned int *J_slap, unsigned int *r_slap, + unsigned int n_start, unsigned int n_end){ + + int i, j, k, w, idx, cur_node; + unsigned int *marked, **preds, *dist, *nj; + double *delta, *cB; + unsigned int d; + unsigned int n, nd, ndp; + + dist = malloc(N * sizeof(unsigned int)); + marked = malloc(N * sizeof(unsigned int)); + preds = malloc(N * sizeof(unsigned int *)); + + nj = malloc(N * sizeof(unsigned int)); + delta = malloc(N * sizeof(double)); + cB = malloc(N * sizeof(double)); + + for (i=0; i<N; i++){ + cB[i] = 0; + preds[i] = NULL; + } + + for (j=n_start; j<=n_end && j<N; j++){ + for(i=0; i<N; i ++){ + dist[i] = N; + if (! preds[i]){ + preds[i] = malloc(sizeof(unsigned int)); + } + preds[i][0] = 0; /* The list of predecessors is now empty! */ + + nj[i] = 0; + delta[i]= 0; + } + dist[j] = 0; + nj[j] = 1; + marked[0] = j; + d = 0; + n = 0; + nd = 1; + ndp = 0; + while (d<N && nd > 0){ + for(i = n; i< n+nd; i ++){ + cur_node = marked[i]; + for (k=r_slap[cur_node]; k<r_slap[cur_node +1] ; k++){ + w = J_slap[k]; + if ( dist[w] == d+1){ + add_predecessor((unsigned int **)(preds + w), cur_node); + nj[w] += nj[cur_node]; + } + if ( dist[w] == N){ + dist[w] = d+1; + marked[n + nd + ndp] = w; + add_predecessor(preds + w, cur_node); + ndp +=1; + nj[w] += nj[cur_node]; + } + } + } + n = n + nd; + nd = ndp; + ndp = 0; + d += 1; + } + for (k= n-1; k>=1; k--){ + w = marked[k]; + for (idx=1; idx <= preds[w][0]; idx ++ ){ + i = preds[w][idx]; + delta[i] += 1.0 * nj[i] / nj[w] * (1 + delta[w]); + } + cB[w] += delta[w]; + } + } + free(dist); + free(marked); + for (i=0; i<N; i++){ + free(preds[i]); + } + free(preds); + free(nj); + free(delta); + + return cB; +} + + + +void dump_cB(double *cB, unsigned int N){ + + unsigned int i; + for (i=0; i<N; i++){ + printf("%g\n", cB[i]); + } +} + + +int main(int argc, char *argv[]){ + + unsigned int *J_slap=NULL, *r_slap=NULL; + unsigned int K, N; + unsigned int n_start, n_end; + double *cB; + FILE *filein; + + n_start = 0; + n_end = -1; + + switch (argc){ + + case 4: + n_end = atoi(argv[3]); + case 3: + n_start = atoi(argv[2]); + case 2: + break; + default: + usage(argv); + exit(1); + break; + } + + if (!strcmp(argv[1], "-")){ + /* take the input from STDIN */ + filein = stdin; + } + else { + filein = openfile_or_exit(argv[1], "r", 2); + } + + read_slap(filein, &K, &N, &J_slap, &r_slap); + if (n_end == -1) + n_end = N-1; + cB = compute_bet_dependency(N, J_slap, r_slap, n_start, n_end); + dump_cB(cB, N); + + free(cB); + free(J_slap); + free(r_slap); + +} diff --git a/src/betweenness/betweenness.c b/src/betweenness/betweenness.c new file mode 100644 index 0000000..5e37747 --- /dev/null +++ b/src/betweenness/betweenness.c @@ -0,0 +1,316 @@ +/** + * 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 + * + *********************************************************************** + * + * This program computes the betweenness of all the nodes of a graph, + * using Brandes' algorithm, and counting all the shortest paths + * originating from a set of nodes (potentially the whole set of + * vertices). + * + * References: + * U. Brandes. "A Faster Algorithm for Betweenness + * Centrality". J. Math. Sociol. 25 (2001), 163-177. + * + */ + + +#include <stdio.h> +#include <stdlib.h> +#include <string.h> + +#include <time.h> + +#include "utils.h" + + +void usage(char *argv[]){ + printf("********************************************************************\n" + "** **\n" + "** -*- betweenness -*- **\n" + "** **\n" + "** Compute the betweenness of all the nodes and edges of a **\n" + "** network due to the shortest paths originating from a set **\n" + "** of initial nodes. The set can be either a sequence of **\n" + "** nodes (if the second argument is 'SEQ') or a random sample **\n" + "** from the set of all the nodes (if it is 'RND'). **\n" + "** **\n" + "** The input file is an edge-list (use '-' to read from STDIN). **\n" + "** **\n" + "** With 'SEQ': **\n" + "** If <node_start> is not specified, computes the betweenness **\n" + "** using shortest paths from *all* the nodes (WARNING: This can **\n" + "** be slow for large graphs!). If <node_end> is not specified, **\n" + "** use shortest paths from all the nodes between <node_start> **\n" + "** and the node with the largest label. **\n" + "** **\n" + "** With 'RND': **\n" + "** Compute the betweenness based on the shortest paths from **\n" + "** <num> nodes sampled uniformly at random. **\n" + "** **\n" + "** When called with just <graph_in>, use all the nodes. **\n" + "** **\n" + "** The betweenness of all the nodes is printed on standard **\n" + "** output (STDOUT), while the edge betweenness is printed on **\n" + "** standard error (STDERR) **\n" + "** **\n" + "********************************************************************\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" + " (c) Vincenzo Nicosia 2009-2017 (v.nicosia@qmul.ac.uk)\n\n"); + printf("Usage: %s <graph_in> [SEQ <node_start> [<node_end>]]\n" , argv[0]); + printf("Usage: %s <graph_in> [RND <num>]\n" , argv[0]); + +} + +/* + * Add a node the a list of predecessors + */ + +void add_predecessor(unsigned int **pred, unsigned int k){ + + (*pred)[0] += 1; + *pred = realloc(*pred, ((*pred)[0] + 1) * sizeof(unsigned int)); + (*pred)[ (*pred)[0] ] = k; +} + + + +/* + * + * Compute node and edge betweenness, based on shortest paths + * originating on the "num" nodes specified in "nlist". "edge_bet" + * should be an appropriately allocated (and initialised to zero!!!!) + * vector of length equal to J_slap, and will contain the values of + * edge betweenness. + * + */ +double* compute_bet_dependency(unsigned int N, unsigned int *J_slap, unsigned int *r_slap, + unsigned int *nlist, unsigned int num, double *edge_bet){ + + int i, j, k, w, idx, cur_node, m; + unsigned int *marked, **preds, *dist, *nj; + double *delta, *cB, val; + unsigned int d; + unsigned int n, nd, ndp; + unsigned int edge_pos; + + dist = malloc(N * sizeof(unsigned int)); + marked = malloc(N * sizeof(unsigned int)); + preds = malloc(N * sizeof(unsigned int *)); + + nj = malloc(N * sizeof(unsigned int)); + delta = malloc(N * sizeof(double)); + cB = malloc(N * sizeof(double)); + + for (i=0; i<N; i++){ + cB[i] = 0; + preds[i] = NULL; + } + + for (m=0; m<num; m++){ + /* We start from the m-th node in nlist*/ + j = nlist[m]; + + for(i=0; i<N; i ++){ + dist[i] = N; + if (! preds[i]){ + preds[i] = malloc(sizeof(unsigned int)); + } + preds[i][0] = 0; /* The list of predecessors is now empty! */ + + nj[i] = 0; + delta[i]= 0; + } + dist[j] = 0; + nj[j] = 1; + marked[0] = j; + d = 0; + n = 0; + nd = 1; + ndp = 0; + while (d<N && nd > 0){ + for(i = n; i< n+nd; i ++){ + cur_node = marked[i]; + for (k=r_slap[cur_node]; k<r_slap[cur_node +1] ; k++){ + w = J_slap[k]; + if ( dist[w] == d+1){ + add_predecessor((unsigned int **)(preds + w), cur_node); + nj[w] += nj[cur_node]; + } + if ( dist[w] == N){ + dist[w] = d+1; + marked[n + nd + ndp] = w; + add_predecessor(preds + w, cur_node); + ndp +=1; + nj[w] += nj[cur_node]; + } + } + } + n = n + nd; + nd = ndp; + ndp = 0; + d += 1; + } + for (k= n-1; k>=1; k--){ + w = marked[k]; + for (idx=1; idx <= preds[w][0]; idx ++ ){ + i = preds[w][idx]; + val = 1.0 * nj[i] / nj[w] * (1 + delta[w]); + delta[i] += val; + /* Now we should update the betweenness of the edge (i,w) in + the appropriate position of the vector edge_bet*/ + find_neigh_in_Jslap(J_slap, r_slap, N, i, w, &edge_pos); + edge_bet[edge_pos] += val; + find_neigh_in_Jslap(J_slap, r_slap, N, w, i, &edge_pos); + edge_bet[edge_pos] += val; + } + cB[w] += delta[w]; + } + } + free(dist); + free(marked); + for (i=0; i<N; i++){ + free(preds[i]); + } + free(preds); + free(nj); + free(delta); + return cB; +} + + + +/* + * print of STDOUT the betweenness of each node + */ +void dump_cB(double *cB, unsigned int N){ + + unsigned int i; + for (i=0; i<N; i++){ + printf("%g\n", cB[i]); + } +} + +/* + * print on STDERR the betweenness of each edge + */ + +void dump_edge_bet(unsigned int *J_slap, unsigned int *r_slap, unsigned int N, + double *v, FILE *fout){ + + unsigned int i, j; + + for(i=0; i<N; i++){ + for (j=r_slap[i]; j<r_slap[i+1]; j++) + fprintf(fout, "%d %d %g\n", i, J_slap[j], v[j]); + } +} + + + +int main(int argc, char *argv[]){ + + unsigned int *J_slap=NULL, *r_slap=NULL; + unsigned int K, N, i; + unsigned int n_start, n_end; + unsigned int *nlist=NULL; + unsigned int num; + double *edge_bet = NULL; + double *cB; + FILE *filein; + + + if(argc < 2){ + usage(argv); + exit(1); + } + + srand(time(NULL)); + + if (!strcmp(argv[1], "-")){ + /* take the input from STDIN */ + filein = stdin; + } + else { + filein = openfile_or_exit(argv[1], "r", 2); + } + + read_slap(filein, &K, &N, &J_slap, &r_slap); + + nlist = malloc(N * sizeof(unsigned int)); + + for(i=0; i<N; i++){ + nlist[i] = i; + } + + n_start = 0; + n_end = N-1; + num = N; + + + if (argc > 3){ + if(!my_strcasecmp(argv[2], "SEQ")){ + n_start = atoi(argv[3]); + if (n_start > N-1) + n_start = 0; + if (argc > 4){ + n_end = atoi(argv[4]); + } + else{ + n_end = N-1; + } + num = n_end - n_start + 1; + } + else if (!my_strcasecmp(argv[2], "RND")){ + num = atoi(argv[3]); + n_start = 0; + n_end = num-1; + if (num > N || num < 1) + num = N; + shuffle_vector(nlist, N); + } + } + + sort_neighbours(J_slap, r_slap, N); + edge_bet = malloc(K * sizeof(double)); + memset(edge_bet, 0, K * sizeof(double)); + cB = compute_bet_dependency(N, J_slap, r_slap, nlist+n_start, num, edge_bet); + + dump_cB(cB, N); + dump_edge_bet(J_slap, r_slap, N, edge_bet, stderr); + + free(cB); + free(J_slap); + free(r_slap); + free(edge_bet); + free(nlist); + +} |